0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: 947bdb7-dirty]
0.00/0.00 c Copyright (c) 2002-2012 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-3691656-1338028790.opb>
0.00/0.01 c original problem has 1190 variables (1190 bin, 0 int, 0 impl, 0 cont) and 3183 constraints
0.00/0.01 c problem read in 0.01
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.04 c (round 1) 124 del vars, 18 del conss, 0 add conss, 5 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60694 impls, 0 clqs
0.00/0.04 c (round 2) 126 del vars, 254 del conss, 0 add conss, 7 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60694 impls, 0 clqs
0.00/0.04 c (round 3) 128 del vars, 259 del conss, 0 add conss, 9 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60718 impls, 0 clqs
0.00/0.04 c (round 4) 132 del vars, 265 del conss, 0 add conss, 13 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60718 impls, 0 clqs
0.00/0.04 c (round 5) 139 del vars, 275 del conss, 0 add conss, 17 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60742 impls, 0 clqs
0.00/0.05 c (round 6) 147 del vars, 293 del conss, 0 add conss, 21 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60808 impls, 0 clqs
0.00/0.05 c (round 7) 154 del vars, 312 del conss, 0 add conss, 25 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60848 impls, 0 clqs
0.00/0.05 c (round 8) 161 del vars, 329 del conss, 0 add conss, 29 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60880 impls, 0 clqs
0.00/0.05 c (round 9) 173 del vars, 355 del conss, 0 add conss, 37 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 60994 impls, 0 clqs
0.00/0.05 c (round 10) 182 del vars, 379 del conss, 0 add conss, 43 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61070 impls, 0 clqs
0.00/0.05 c (round 11) 186 del vars, 397 del conss, 0 add conss, 47 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61074 impls, 0 clqs
0.00/0.05 c (round 12) 190 del vars, 405 del conss, 0 add conss, 51 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61074 impls, 0 clqs
0.00/0.05 c (round 13) 196 del vars, 413 del conss, 0 add conss, 54 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61110 impls, 0 clqs
0.00/0.05 c (round 14) 201 del vars, 425 del conss, 0 add conss, 56 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61180 impls, 0 clqs
0.00/0.05 c (round 15) 206 del vars, 437 del conss, 0 add conss, 58 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61338 impls, 0 clqs
0.00/0.05 c (round 16) 208 del vars, 449 del conss, 0 add conss, 60 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61348 impls, 0 clqs
0.00/0.05 c (round 17) 211 del vars, 453 del conss, 0 add conss, 60 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61520 impls, 0 clqs
0.00/0.06 c (round 18) 211 del vars, 460 del conss, 0 add conss, 60 chg bounds, 64 chg sides, 136 chg coeffs, 0 upgd conss, 61520 impls, 0 clqs
0.05/0.08 c (round 19) 211 del vars, 468 del conss, 0 add conss, 60 chg bounds, 64 chg sides, 136 chg coeffs, 2711 upgd conss, 61520 impls, 0 clqs
0.05/0.09 c (round 20) 231 del vars, 472 del conss, 0 add conss, 60 chg bounds, 64 chg sides, 136 chg coeffs, 2711 upgd conss, 61520 impls, 0 clqs
0.05/0.09 c (round 21) 231 del vars, 2994 del conss, 830 add conss, 60 chg bounds, 64 chg sides, 136 chg coeffs, 2711 upgd conss, 61520 impls, 0 clqs
0.09/0.10 c (round 22) 432 del vars, 3058 del conss, 894 add conss, 60 chg bounds, 64 chg sides, 136 chg coeffs, 2711 upgd conss, 61774 impls, 31 clqs
0.09/0.10 c (round 23) 433 del vars, 3259 del conss, 1095 add conss, 60 chg bounds, 64 chg sides, 136 chg coeffs, 2711 upgd conss, 62514 impls, 95 clqs
0.09/0.13 c (round 24) 440 del vars, 3330 del conss, 1096 add conss, 60 chg bounds, 64 chg sides, 136 chg coeffs, 2711 upgd conss, 62600 impls, 96 clqs
0.09/0.13 c (round 25) 448 del vars, 3333 del conss, 1097 add conss, 60 chg bounds, 64 chg sides, 136 chg coeffs, 2713 upgd conss, 62636 impls, 94 clqs
0.09/0.14 c (round 26) 450 del vars, 3338 del conss, 1099 add conss, 60 chg bounds, 64 chg sides, 136 chg coeffs, 2713 upgd conss, 62660 impls, 94 clqs
0.09/0.14 c (round 27) 450 del vars, 3340 del conss, 1099 add conss, 60 chg bounds, 64 chg sides, 136 chg coeffs, 2713 upgd conss, 62660 impls, 95 clqs
0.09/0.15 c (round 28) 451 del vars, 3341 del conss, 1099 add conss, 60 chg bounds, 64 chg sides, 136 chg coeffs, 2713 upgd conss, 62676 impls, 95 clqs
0.09/0.15 c presolving (29 rounds):
0.09/0.15 c 451 deleted vars, 3341 deleted constraints, 1099 added constraints, 60 tightened bounds, 0 added holes, 64 changed sides, 136 changed coefficients
0.09/0.15 c 62676 implications, 95 cliques
0.09/0.15 c presolved problem has 739 variables (739 bin, 0 int, 0 impl, 0 cont) and 939 constraints
0.09/0.15 c 112 constraints of type <knapsack>
0.09/0.15 c 280 constraints of type <setppc>
0.09/0.15 c 515 constraints of type <and>
0.09/0.15 c 32 constraints of type <logicor>
0.09/0.15 c transformed objective value is always integral (scale: 1)
0.09/0.15 c Presolving Time: 0.13
0.09/0.15 c - non default parameters ----------------------------------------------------------------------
0.09/0.15 c # SCIP version 2.1.1.4
0.09/0.15 c
0.09/0.15 c # maximal time in seconds to run
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/time = 1797
0.09/0.15 c
0.09/0.15 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/memory = 13950
0.09/0.15 c
0.09/0.15 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c limits/solutions = 1
0.09/0.15 c
0.09/0.15 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.15 c separating/maxrounds = 1
0.09/0.15 c
0.09/0.15 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c separating/maxroundsroot = 5
0.09/0.15 c
0.09/0.15 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.15 c # [type: int, range: [1,2], default: 1]
0.09/0.15 c timing/clocktype = 2
0.09/0.15 c
0.09/0.15 c # belongs reading time to solving time?
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c timing/reading = TRUE
0.09/0.15 c
0.09/0.15 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.15 c constraints/knapsack/disaggregation = FALSE
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/coefdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.15 c heuristics/crossover/freq = -1
0.09/0.15 c
0.09/0.15 c # number of nodes added to the contingent of the total nodes
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15 c heuristics/crossover/nodesofs = 750
0.09/0.15 c
0.09/0.15 c # number of nodes without incumbent change that heuristic should wait
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.15 c heuristics/crossover/nwaitingnodes = 100
0.09/0.15 c
0.09/0.15 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.15 c # [type: real, range: [0,1], default: 0.1]
0.09/0.15 c heuristics/crossover/nodesquot = 0.15
0.09/0.15 c
0.09/0.15 c # minimum percentage of integer variables that have to be fixed
0.09/0.15 c # [type: real, range: [0,1], default: 0.666]
0.09/0.15 c heuristics/crossover/minfixingrate = 0.5
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/feaspump/freq = -1
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/fracdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/guideddiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/intshifting/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/linesearchdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/objpscostdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.15 c # [type: real, range: [0,1], default: 0.01]
0.09/0.15 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/oneopt/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/pscostdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/rens/freq = -1
0.09/0.15 c
0.09/0.15 c # minimum percentage of integer variables that have to be fixable
0.09/0.15 c # [type: real, range: [0,1], default: 0.5]
0.09/0.15 c heuristics/rens/minfixingrate = 0.3
0.09/0.15 c
0.09/0.15 c # number of nodes added to the contingent of the total nodes
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15 c heuristics/rens/nodesofs = 2000
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/rootsoldiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.15 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/rounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/shiftandpropagate/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/shifting/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/simplerounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/subnlp/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/trivial/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/trysol/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/undercover/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/veclendiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/zirounding/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c propagating/probing/maxprerounds = 0
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c separating/cmir/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c separating/flowcover/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c separating/rapidlearning/freq = 0
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/indoneopt/freq = -1
0.09/0.15 c
0.09/0.15 c -----------------------------------------------------------------------------------------------
0.09/0.15 c start solving
0.09/0.15 c
0.09/0.16 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.16 c 0.2s| 1 | 0 | 171 | - |7540k| 0 | 125 | 739 | 939 | 739 |1454 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.3s| 1 | 0 | 185 | - |7027k| 0 | - | 739 |1011 | 739 |1454 | 0 | 0 | 0 | cutoff | -- | 0.00%
0.19/0.25 c 0.3s| 1 | 0 | 185 | - |7027k| 0 | - | 739 |1011 | 739 |1454 | 0 | 0 | 0 | cutoff | -- | 0.00%
0.19/0.25 c
0.19/0.25 c SCIP Status : problem is solved [infeasible]
0.19/0.25 c Solving Time (sec) : 0.25
0.19/0.25 c Solving Nodes : 1
0.19/0.25 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.19/0.25 c Dual Bound : +1.00000000000000e+20
0.19/0.25 c Gap : 0.00 %
0.19/0.25 s UNSATISFIABLE
0.19/0.25 c SCIP Status : problem is solved [infeasible]
0.19/0.25 c Total Time : 0.25
0.19/0.25 c solving : 0.25
0.19/0.25 c presolving : 0.13 (included in solving)
0.19/0.25 c reading : 0.01 (included in solving)
0.19/0.25 c copying : 0.01 (1 #copies) (minimal 0.01, maximal 0.01, average 0.01)
0.19/0.25 c Original Problem :
0.19/0.25 c Problem name : HOME/instance-3691656-1338028790.opb
0.19/0.25 c Variables : 1190 (1190 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.25 c Constraints : 3183 initial, 3183 maximal
0.19/0.25 c Objective sense : minimize
0.19/0.25 c Presolved Problem :
0.19/0.25 c Problem name : t_HOME/instance-3691656-1338028790.opb
0.19/0.25 c Variables : 739 (739 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.25 c Constraints : 939 initial, 1011 maximal
0.19/0.25 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.19/0.25 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.19/0.25 c trivial : 0.00 0.00 4 0 0 0 0 0 0 0 0
0.19/0.25 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.19/0.25 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.19/0.25 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.19/0.25 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.19/0.25 c gateextraction : 0.01 0.00 0 0 0 0 0 2522 830 0 0
0.19/0.25 c implics : 0.01 0.00 0 146 0 0 0 0 0 0 0
0.19/0.25 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.19/0.25 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.19/0.25 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.19/0.25 c knapsack : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.19/0.25 c setppc : 0.01 0.00 0 2 0 0 0 68 0 0 0
0.19/0.25 c and : 0.05 0.00 0 214 0 0 0 279 269 0 0
0.19/0.25 c linear : 0.04 0.00 60 25 0 60 0 472 0 64 136
0.19/0.25 c logicor : 0.01 0.00 0 0 0 0 0 0 0 0 0
0.19/0.25 c root node : - - 348 - - 348 - - - - -
0.19/0.25 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.19/0.25 c integral : 0 0 0 0 0 0 1 0 0 0 0 0 0
0.19/0.25 c knapsack : 112 112 1 1 0 0 0 0 0 0 72 0 0
0.19/0.25 c setppc : 280 280 1 1 0 0 0 0 0 0 0 0 0
0.19/0.25 c and : 515 515 1 1 0 0 0 0 0 0 37 0 0
0.19/0.25 c linear : 0+ 72 0 0 0 0 0 0 0 0 0 0 0
0.19/0.25 c logicor : 32 32 1 1 0 0 0 0 0 0 0 0 0
0.19/0.25 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0
0.19/0.25 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.19/0.25 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.25 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.25 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.25 c and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.25 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.25 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.25 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.25 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.19/0.25 c rootredcost : 0 0 0 0
0.19/0.25 c pseudoobj : 0 0 0 0
0.19/0.25 c vbounds : 0 0 0 0
0.19/0.25 c redcost : 1 0 0 0
0.19/0.25 c probing : 0 0 0 0
0.19/0.25 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.19/0.25 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.19/0.25 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.19/0.25 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.19/0.25 c redcost : 0.00 0.00 0.00 0.00 0.00
0.19/0.25 c probing : 0.00 0.00 0.00 0.00 0.00
0.19/0.25 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.19/0.25 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.19/0.25 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.25 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.25 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.25 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.19/0.25 c applied globally : - - - 0 0.0 - - -
0.19/0.25 c applied locally : - - - 0 0.0 - - -
0.19/0.25 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.19/0.25 c cut pool : 0.00 0 - - 0 - (maximal pool size: 283)
0.19/0.25 c closecuts : 0.00 0.00 0 0 0 0 0
0.19/0.25 c impliedbounds : 0.00 0.00 1 0 0 247 0
0.19/0.25 c intobj : 0.00 0.00 0 0 0 0 0
0.19/0.25 c gomory : 0.00 0.00 1 0 0 50 0
0.19/0.25 c cgmip : 0.00 0.00 0 0 0 0 0
0.19/0.25 c strongcg : 0.01 0.00 1 0 0 451 0
0.19/0.25 c cmir : 0.00 0.00 0 0 0 0 0
0.19/0.25 c flowcover : 0.00 0.00 0 0 0 0 0
0.19/0.25 c clique : 0.01 0.00 1 0 0 7 0
0.19/0.25 c zerohalf : 0.00 0.00 0 0 0 0 0
0.19/0.25 c mcf : 0.00 0.00 1 0 0 0 0
0.19/0.25 c oddcycle : 0.00 0.00 0 0 0 0 0
0.19/0.25 c rapidlearning : 0.07 0.00 1 0 348 0 72
0.19/0.25 c Pricers : ExecTime SetupTime Calls Vars
0.19/0.25 c problem variables: 0.00 - 0 0
0.19/0.25 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.19/0.25 c pscost : 0.00 0.00 0 0 0 0 0 0
0.19/0.25 c inference : 0.00 0.00 0 0 0 0 0 0
0.19/0.25 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.19/0.25 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.19/0.25 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.19/0.25 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.19/0.25 c random : 0.00 0.00 0 0 0 0 0 0
0.19/0.25 c relpscost : 0.00 0.00 0 0 0 0 0 0
0.19/0.25 c Primal Heuristics : ExecTime SetupTime Calls Found
0.19/0.25 c LP solutions : 0.00 - - 0
0.19/0.25 c pseudo solutions : 0.00 - - 0
0.19/0.25 c smallcard : 0.00 0.00 0 0
0.19/0.25 c trivial : 0.00 0.00 1 0
0.19/0.25 c shiftandpropagate: 0.00 0.00 0 0
0.19/0.25 c simplerounding : 0.00 0.00 0 0
0.19/0.25 c zirounding : 0.00 0.00 0 0
0.19/0.25 c rounding : 0.00 0.00 0 0
0.19/0.25 c shifting : 0.00 0.00 0 0
0.19/0.25 c intshifting : 0.00 0.00 0 0
0.19/0.25 c oneopt : 0.00 0.00 0 0
0.19/0.25 c twoopt : 0.00 0.00 0 0
0.19/0.25 c indtwoopt : 0.00 0.00 0 0
0.19/0.25 c indoneopt : 0.00 0.00 0 0
0.19/0.25 c fixandinfer : 0.00 0.00 0 0
0.19/0.25 c feaspump : 0.00 0.00 0 0
0.19/0.25 c clique : 0.00 0.00 0 0
0.19/0.25 c indrounding : 0.00 0.00 0 0
0.19/0.25 c indcoefdiving : 0.00 0.00 0 0
0.19/0.25 c coefdiving : 0.00 0.00 0 0
0.19/0.25 c pscostdiving : 0.00 0.00 0 0
0.19/0.25 c nlpdiving : 0.00 0.00 0 0
0.19/0.25 c fracdiving : 0.00 0.00 0 0
0.19/0.25 c veclendiving : 0.00 0.00 0 0
0.19/0.25 c intdiving : 0.00 0.00 0 0
0.19/0.25 c actconsdiving : 0.00 0.00 0 0
0.19/0.25 c objpscostdiving : 0.00 0.00 0 0
0.19/0.25 c rootsoldiving : 0.00 0.00 0 0
0.19/0.25 c linesearchdiving : 0.00 0.00 0 0
0.19/0.25 c guideddiving : 0.00 0.00 0 0
0.19/0.25 c octane : 0.00 0.00 0 0
0.19/0.25 c rens : 0.00 0.00 0 0
0.19/0.25 c rins : 0.00 0.00 0 0
0.19/0.25 c localbranching : 0.00 0.00 0 0
0.19/0.25 c mutation : 0.00 0.00 0 0
0.19/0.25 c crossover : 0.00 0.00 0 0
0.19/0.25 c dins : 0.00 0.00 0 0
0.19/0.25 c vbounds : 0.00 0.00 0 0
0.19/0.25 c undercover : 0.00 0.00 0 0
0.19/0.25 c subnlp : 0.00 0.00 0 0
0.19/0.25 c trysol : 0.00 0.00 0 0
0.19/0.25 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.19/0.25 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.19/0.25 c dual LP : 0.01 2 185 92.50 - 0.00 0
0.19/0.25 c lex dual LP : 0.00 0 0 0.00 -
0.19/0.25 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.19/0.25 c diving/probing LP: 0.00 0 0 0.00 -
0.19/0.25 c strong branching : 0.00 0 0 0.00 -
0.19/0.25 c (at root node) : - 0 0 0.00 -
0.19/0.25 c conflict analysis: 0.00 0 0 0.00 -
0.19/0.25 c B&B Tree :
0.19/0.25 c number of runs : 1
0.19/0.25 c nodes : 1
0.19/0.25 c nodes (total) : 1
0.19/0.25 c nodes left : 0
0.19/0.25 c max depth : 0
0.19/0.25 c max depth (total): 0
0.19/0.25 c backtracks : 0 (0.0%)
0.19/0.25 c delayed cutoffs : 0
0.19/0.25 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.19/0.25 c avg switch length: 2.00
0.19/0.25 c switching time : 0.00
0.19/0.25 c Solution :
0.19/0.25 c Solutions found : 0 (0 improvements)
0.19/0.25 c Primal Bound : infeasible
0.19/0.25 c Dual Bound : -
0.19/0.25 c Gap : 0.00 %
0.19/0.25 c Root Dual Bound : -
0.19/0.25 c Root Iterations : 185
0.19/0.26 c Time complete: 0.26.