0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-2665971-1276330848.opb>
0.00/0.07 c original problem has 1612 variables (1612 bin, 0 int, 0 impl, 0 cont) and 3653 constraints
0.00/0.07 c problem read
0.00/0.07 c No objective function, only one solution is needed.
0.00/0.07 c presolving settings loaded
0.09/0.10 c presolving:
0.09/0.15 c (round 1) 215 del vars, 150 del conss, 49 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 57928 impls, 0 clqs
0.09/0.16 c (round 2) 217 del vars, 498 del conss, 51 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 57928 impls, 0 clqs
0.09/0.17 c (round 3) 236 del vars, 522 del conss, 61 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58276 impls, 0 clqs
0.09/0.18 c (round 4) 243 del vars, 552 del conss, 65 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58316 impls, 0 clqs
0.09/0.18 c (round 5) 255 del vars, 574 del conss, 71 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58394 impls, 0 clqs
0.09/0.19 c (round 6) 269 del vars, 606 del conss, 79 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58496 impls, 0 clqs
0.09/0.19 c (round 7) 293 del vars, 663 del conss, 98 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58598 impls, 0 clqs
0.19/0.20 c (round 8) 317 del vars, 718 del conss, 112 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58904 impls, 0 clqs
0.19/0.21 c (round 9) 334 del vars, 776 del conss, 129 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58936 impls, 0 clqs
0.19/0.21 c (round 10) 419 del vars, 967 del conss, 194 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 59680 impls, 0 clqs
0.19/0.22 c (round 11) 454 del vars, 1071 del conss, 219 chg bounds, 194 chg sides, 398 chg coeffs, 0 upgd conss, 60363 impls, 0 clqs
0.19/0.23 c (round 12) 474 del vars, 1137 del conss, 225 chg bounds, 194 chg sides, 398 chg coeffs, 0 upgd conss, 60609 impls, 0 clqs
0.19/0.23 c (round 13) 477 del vars, 1170 del conss, 227 chg bounds, 194 chg sides, 398 chg coeffs, 0 upgd conss, 60695 impls, 0 clqs
0.19/0.24 c (round 14) 485 del vars, 1187 del conss, 232 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 60952 impls, 0 clqs
0.19/0.24 c (round 15) 501 del vars, 1223 del conss, 243 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61346 impls, 0 clqs
0.19/0.25 c (round 16) 513 del vars, 1258 del conss, 250 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61358 impls, 0 clqs
0.19/0.25 c (round 17) 517 del vars, 1280 del conss, 252 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61364 impls, 0 clqs
0.19/0.26 c (round 18) 520 del vars, 1290 del conss, 254 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61368 impls, 0 clqs
0.19/0.26 c (round 19) 522 del vars, 1297 del conss, 256 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61370 impls, 0 clqs
0.19/0.27 c (round 20) 524 del vars, 1303 del conss, 258 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61372 impls, 0 clqs
0.19/0.27 c (round 21) 528 del vars, 1309 del conss, 262 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61372 impls, 0 clqs
0.19/0.28 c (round 22) 534 del vars, 1323 del conss, 268 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61392 impls, 0 clqs
0.19/0.28 c (round 23) 544 del vars, 1346 del conss, 272 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61475 impls, 0 clqs
0.19/0.29 c (round 24) 550 del vars, 1368 del conss, 275 chg bounds, 197 chg sides, 401 chg coeffs, 0 upgd conss, 61512 impls, 0 clqs
0.19/0.29 c (round 25) 554 del vars, 1382 del conss, 277 chg bounds, 198 chg sides, 403 chg coeffs, 0 upgd conss, 61524 impls, 0 clqs
0.19/0.30 c (round 26) 561 del vars, 1404 del conss, 280 chg bounds, 199 chg sides, 405 chg coeffs, 0 upgd conss, 61707 impls, 0 clqs
0.29/0.30 c (round 27) 566 del vars, 1420 del conss, 282 chg bounds, 199 chg sides, 405 chg coeffs, 0 upgd conss, 61731 impls, 0 clqs
0.29/0.30 c (round 28) 567 del vars, 1427 del conss, 282 chg bounds, 199 chg sides, 405 chg coeffs, 0 upgd conss, 61739 impls, 0 clqs
0.29/0.31 c (round 29) 567 del vars, 1429 del conss, 282 chg bounds, 199 chg sides, 405 chg coeffs, 0 upgd conss, 61739 impls, 0 clqs
0.29/0.36 c (round 30) 567 del vars, 1446 del conss, 282 chg bounds, 199 chg sides, 405 chg coeffs, 2195 upgd conss, 61739 impls, 0 clqs
0.29/0.38 c (round 31) 639 del vars, 1458 del conss, 282 chg bounds, 199 chg sides, 405 chg coeffs, 2195 upgd conss, 61739 impls, 0 clqs
0.39/0.40 c presolving (32 rounds):
0.39/0.40 c 639 deleted vars, 1458 deleted constraints, 282 tightened bounds, 0 added holes, 199 changed sides, 405 changed coefficients
0.39/0.40 c 61739 implications, 0 cliques
0.39/0.40 c presolved problem has 973 variables (973 bin, 0 int, 0 impl, 0 cont) and 2195 constraints
0.39/0.40 c 332 constraints of type <knapsack>
0.39/0.40 c 1863 constraints of type <logicor>
0.39/0.40 c transformed objective value is always integral (scale: 1)
0.39/0.40 c Presolving Time: 0.24
0.39/0.40 c - non default parameters ----------------------------------------------------------------------
0.39/0.40 c # SCIP version 1.2.1.2
0.39/0.40 c
0.39/0.40 c # frequency for displaying node information lines
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 100]
0.39/0.40 c display/freq = 10000
0.39/0.40 c
0.39/0.40 c # maximal time in seconds to run
0.39/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.40 c limits/time = 1799.93
0.39/0.40 c
0.39/0.40 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.39/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.40 c limits/memory = 1620
0.39/0.40 c
0.39/0.40 c # solving stops, if the given number of solutions were found (-1: no limit)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.40 c limits/solutions = 1
0.39/0.40 c
0.39/0.40 c # maximal number of separation rounds per node (-1: unlimited)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 5]
0.39/0.40 c separating/maxrounds = 1
0.39/0.40 c
0.39/0.40 c # maximal number of separation rounds in the root node (-1: unlimited)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.40 c separating/maxroundsroot = 5
0.39/0.40 c
0.39/0.40 c # should presolving try to simplify inequalities
0.39/0.40 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.40 c constraints/linear/simplifyinequalities = TRUE
0.39/0.40 c
0.39/0.40 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.39/0.40 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.39/0.40 c constraints/knapsack/disaggregation = FALSE
0.39/0.40 c
0.39/0.40 c # should presolving try to simplify knapsacks
0.39/0.40 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.40 c constraints/knapsack/simplifyinequalities = TRUE
0.39/0.40 c
0.39/0.40 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.40 c presolving/probing/maxrounds = 0
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.40 c heuristics/coefdiving/freq = -1
0.39/0.40 c
0.39/0.40 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.40 c heuristics/coefdiving/maxlpiterquot = 0.075
0.39/0.40 c
0.39/0.40 c # additional number of allowed LP iterations
0.39/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.40 c heuristics/coefdiving/maxlpiterofs = 1500
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 30]
0.39/0.40 c heuristics/crossover/freq = -1
0.39/0.40 c
0.39/0.40 c # number of nodes added to the contingent of the total nodes
0.39/0.40 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.40 c heuristics/crossover/nodesofs = 750
0.39/0.40 c
0.39/0.40 c # number of nodes without incumbent change that heuristic should wait
0.39/0.40 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.39/0.40 c heuristics/crossover/nwaitingnodes = 100
0.39/0.40 c
0.39/0.40 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.39/0.40 c # [type: real, range: [0,1], default: 0.1]
0.39/0.40 c heuristics/crossover/nodesquot = 0.15
0.39/0.40 c
0.39/0.40 c # minimum percentage of integer variables that have to be fixed
0.39/0.40 c # [type: real, range: [0,1], default: 0.666]
0.39/0.40 c heuristics/crossover/minfixingrate = 0.5
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.40 c heuristics/feaspump/freq = -1
0.39/0.40 c
0.39/0.40 c # additional number of allowed LP iterations
0.39/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.40 c heuristics/feaspump/maxlpiterofs = 2000
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.40 c heuristics/fracdiving/freq = -1
0.39/0.40 c
0.39/0.40 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.40 c heuristics/fracdiving/maxlpiterquot = 0.075
0.39/0.40 c
0.39/0.40 c # additional number of allowed LP iterations
0.39/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.40 c heuristics/fracdiving/maxlpiterofs = 1500
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.40 c heuristics/guideddiving/freq = -1
0.39/0.40 c
0.39/0.40 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.40 c heuristics/guideddiving/maxlpiterquot = 0.075
0.39/0.40 c
0.39/0.40 c # additional number of allowed LP iterations
0.39/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.40 c heuristics/guideddiving/maxlpiterofs = 1500
0.39/0.40 c
0.39/0.40 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.40 c heuristics/intdiving/maxlpiterquot = 0.075
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.40 c heuristics/intshifting/freq = -1
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.40 c heuristics/linesearchdiving/freq = -1
0.39/0.40 c
0.39/0.40 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.40 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.39/0.40 c
0.39/0.40 c # additional number of allowed LP iterations
0.39/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.40 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.40 c heuristics/nlp/freq = -1
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.40 c heuristics/objpscostdiving/freq = -1
0.39/0.40 c
0.39/0.40 c # maximal fraction of diving LP iterations compared to total iteration number
0.39/0.40 c # [type: real, range: [0,1], default: 0.01]
0.39/0.40 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.39/0.40 c
0.39/0.40 c # additional number of allowed LP iterations
0.39/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.40 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.40 c heuristics/oneopt/freq = -1
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.40 c heuristics/pscostdiving/freq = -1
0.39/0.40 c
0.39/0.40 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.40 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.39/0.40 c
0.39/0.40 c # additional number of allowed LP iterations
0.39/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.40 c heuristics/pscostdiving/maxlpiterofs = 1500
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.40 c heuristics/rens/freq = -1
0.39/0.40 c
0.39/0.40 c # minimum percentage of integer variables that have to be fixable
0.39/0.40 c # [type: real, range: [0,1], default: 0.5]
0.39/0.40 c heuristics/rens/minfixingrate = 0.3
0.39/0.40 c
0.39/0.40 c # number of nodes added to the contingent of the total nodes
0.39/0.40 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.40 c heuristics/rens/nodesofs = 2000
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.40 c heuristics/rootsoldiving/freq = -1
0.39/0.40 c
0.39/0.40 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.39/0.40 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.39/0.40 c
0.39/0.40 c # additional number of allowed LP iterations
0.39/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.40 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.40 c heuristics/rounding/freq = -1
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.40 c heuristics/shifting/freq = -1
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.40 c heuristics/simplerounding/freq = -1
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.40 c heuristics/trivial/freq = -1
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.40 c heuristics/trysol/freq = -1
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.40 c heuristics/veclendiving/freq = -1
0.39/0.40 c
0.39/0.40 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.40 c heuristics/veclendiving/maxlpiterquot = 0.075
0.39/0.40 c
0.39/0.40 c # additional number of allowed LP iterations
0.39/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.40 c heuristics/veclendiving/maxlpiterofs = 1500
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.40 c heuristics/zirounding/freq = -1
0.39/0.40 c
0.39/0.40 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.40 c separating/cmir/freq = -1
0.39/0.40 c
0.39/0.40 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.40 c separating/flowcover/freq = -1
0.39/0.40 c
0.39/0.40 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.40 c separating/rapidlearning/freq = 0
0.39/0.40 c
0.39/0.40 c -----------------------------------------------------------------------------------------------
0.39/0.40 c start solving
0.39/0.41 c
0.39/0.43 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.43 c 0.3s| 1 | 0 | 238 | - |8203k| 0 | 227 | 973 |2195 | 973 |2195 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.79/0.89 c 0.7s| 1 | 0 | 380 | - |8572k| 0 | 218 | 973 |2395 | 973 |2248 | 53 | 0 | 0 | 0.000000e+00 | -- | Inf
0.99/1.02 c 0.8s| 1 | 0 | 509 | - |8625k| 0 | 285 | 973 |2395 | 973 |2309 | 114 | 0 | 0 | 0.000000e+00 | -- | Inf
1.10/1.18 c 0.9s| 1 | 0 | 688 | - |8668k| 0 | 361 | 973 |2395 | 973 |2362 | 167 | 0 | 0 | 0.000000e+00 | -- | Inf
1.39/1.43 c 1.2s| 1 | 0 | 1129 | - |8789k| 0 | 506 | 973 |2395 | 973 |2430 | 235 | 0 | 0 | 0.000000e+00 | -- | Inf
1.79/1.88 c 1.6s| 1 | 0 | 1425 | - |8830k| 0 | 580 | 973 |2395 | 973 |2473 | 278 | 0 | 0 | 0.000000e+00 | -- | Inf
4.40/4.43 c 4.2s| 1 | 2 | 1425 | - |8831k| 0 | 580 | 973 |2395 | 973 |2473 | 278 | 0 | 22 | 0.000000e+00 | -- | Inf
46.28/46.30 c
46.28/46.30 c SCIP Status : problem is solved [infeasible]
46.28/46.30 c Solving Time (sec) : 45.74
46.28/46.30 c Solving Nodes : 500
46.28/46.30 c Primal Bound : +1.00000000000000e+20 (0 solutions)
46.28/46.30 c Dual Bound : +1.00000000000000e+20
46.28/46.30 c Gap : 0.00 %
46.28/46.30 s UNSATISFIABLE
46.28/46.30 c SCIP Status : problem is solved [infeasible]
46.28/46.30 c Solving Time : 45.74
46.28/46.30 c Original Problem :
46.28/46.30 c Problem name : HOME/instance-2665971-1276330848.opb
46.28/46.30 c Variables : 1612 (1612 binary, 0 integer, 0 implicit integer, 0 continuous)
46.28/46.30 c Constraints : 3653 initial, 3653 maximal
46.28/46.30 c Presolved Problem :
46.28/46.30 c Problem name : t_HOME/instance-2665971-1276330848.opb
46.28/46.30 c Variables : 973 (973 binary, 0 integer, 0 implicit integer, 0 continuous)
46.28/46.30 c Constraints : 2195 initial, 2466 maximal
46.28/46.30 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
46.28/46.30 c trivial : 0.01 1 0 0 0 0 0 0 0
46.28/46.30 c dualfix : 0.01 0 0 0 0 0 0 0 0
46.28/46.30 c boundshift : 0.00 0 0 0 0 0 0 0 0
46.28/46.30 c inttobinary : 0.00 0 0 0 0 0 0 0 0
46.28/46.30 c implics : 0.02 0 274 0 0 0 0 0 0
46.28/46.30 c probing : 0.00 0 0 0 0 0 0 0 0
46.28/46.30 c knapsack : 0.02 0 0 0 0 0 0 0 0
46.28/46.30 c linear : 0.12 281 83 0 282 0 1458 199 405
46.28/46.30 c logicor : 0.03 0 0 0 0 0 0 0 0
46.28/46.30 c root node : - 342 - - 342 - - - -
46.28/46.30 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
46.28/46.30 c integral : 0 0 0 438 0 0 3 0 0 874
46.28/46.30 c knapsack : 332 5 2521 0 0 14 864 848 0 0
46.28/46.30 c linear : 0+ 5 2469 0 0 0 45 72 0 0
46.28/46.30 c logicor : 1863+ 5 1768 0 0 50 5816 0 0 0
46.28/46.30 c countsols : 0 0 0 0 0 0 0 0 0 0
46.28/46.30 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
46.28/46.30 c integral : 39.93 0.00 0.00 39.93 0.00
46.28/46.30 c knapsack : 0.12 0.04 0.08 0.00 0.00
46.28/46.30 c linear : 0.02 0.00 0.02 0.00 0.00
46.28/46.30 c logicor : 0.06 0.00 0.06 0.00 0.00
46.28/46.30 c countsols : 0.00 0.00 0.00 0.00 0.00
46.28/46.30 c Propagators : Time Calls Cutoffs DomReds
46.28/46.30 c vbounds : 0.00 1 0 0
46.28/46.30 c rootredcost : 0.00 0 0 0
46.28/46.30 c pseudoobj : 0.00 0 0 0
46.28/46.30 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
46.28/46.30 c propagation : 0.01 64 63 172 8.1 12 4.4 -
46.28/46.30 c infeasible LP : 0.02 30 8 13 2.2 2 2.0 0
46.28/46.30 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
46.28/46.30 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
46.28/46.30 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
46.28/46.30 c applied globally : - - - 131 5.9 - - -
46.28/46.30 c applied locally : - - - 0 0.0 - - -
46.28/46.30 c Separators : Time Calls Cutoffs DomReds Cuts Conss
46.28/46.30 c cut pool : 0.00 4 - - 12 - (maximal pool size: 225)
46.28/46.30 c redcost : 0.01 442 0 0 0 0
46.28/46.30 c impliedbounds : 0.00 5 0 0 0 0
46.28/46.30 c intobj : 0.00 0 0 0 0 0
46.28/46.30 c cgmip : 0.00 0 0 0 0 0
46.28/46.30 c gomory : 0.36 5 0 0 1688 0
46.28/46.30 c strongcg : 0.29 5 0 0 1691 0
46.28/46.30 c cmir : 0.00 0 0 0 0 0
46.28/46.30 c flowcover : 0.00 0 0 0 0 0
46.28/46.30 c clique : 0.05 5 0 0 31 0
46.28/46.30 c zerohalf : 0.00 0 0 0 0 0
46.28/46.30 c mcf : 0.00 1 0 0 0 0
46.28/46.30 c rapidlearning : 0.32 1 0 0 0 200
46.28/46.30 c Pricers : Time Calls Vars
46.28/46.30 c problem variables: 0.00 0 0
46.28/46.30 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
46.28/46.30 c relpscost : 39.93 438 0 3 0 0 874
46.28/46.30 c pscost : 0.00 0 0 0 0 0 0
46.28/46.30 c inference : 0.00 0 0 0 0 0 0
46.28/46.30 c mostinf : 0.00 0 0 0 0 0 0
46.28/46.30 c leastinf : 0.00 0 0 0 0 0 0
46.28/46.30 c fullstrong : 0.00 0 0 0 0 0 0
46.28/46.30 c allfullstrong : 0.00 0 0 0 0 0 0
46.28/46.30 c random : 0.00 0 0 0 0 0 0
46.28/46.30 c Primal Heuristics : Time Calls Found
46.28/46.30 c LP solutions : 0.00 - 0
46.28/46.30 c pseudo solutions : 0.00 - 0
46.28/46.30 c trivial : 0.00 1 0
46.28/46.30 c simplerounding : 0.00 0 0
46.28/46.30 c zirounding : 0.00 0 0
46.28/46.30 c rounding : 0.00 0 0
46.28/46.30 c shifting : 0.00 0 0
46.28/46.30 c intshifting : 0.00 0 0
46.28/46.30 c oneopt : 0.00 0 0
46.28/46.30 c twoopt : 0.00 0 0
46.28/46.30 c fixandinfer : 0.00 0 0
46.28/46.30 c feaspump : 0.00 0 0
46.28/46.30 c coefdiving : 0.00 0 0
46.28/46.30 c pscostdiving : 0.00 0 0
46.28/46.30 c fracdiving : 0.00 0 0
46.28/46.30 c veclendiving : 0.00 0 0
46.28/46.30 c intdiving : 0.00 0 0
46.28/46.30 c actconsdiving : 0.00 0 0
46.28/46.30 c objpscostdiving : 0.00 0 0
46.28/46.30 c rootsoldiving : 0.00 0 0
46.28/46.30 c linesearchdiving : 0.00 0 0
46.28/46.30 c guideddiving : 0.00 0 0
46.28/46.30 c octane : 0.00 0 0
46.28/46.30 c rens : 0.00 0 0
46.28/46.30 c rins : 0.00 0 0
46.28/46.30 c localbranching : 0.00 0 0
46.28/46.30 c mutation : 0.00 0 0
46.28/46.30 c crossover : 0.00 0 0
46.28/46.30 c dins : 0.00 0 0
46.28/46.30 c undercover : 0.00 0 0
46.28/46.30 c nlp : 0.00 0 0
46.28/46.30 c trysol : 0.00 0 0
46.28/46.30 c LP : Time Calls Iterations Iter/call Iter/sec
46.28/46.30 c primal LP : 0.01 0 0 0.00 0.00
46.28/46.30 c dual LP : 3.69 472 11735 24.86 3180.22
46.28/46.30 c lex dual LP : 0.00 0 0 0.00 -
46.28/46.30 c barrier LP : 0.00 0 0 0.00 -
46.28/46.30 c diving/probing LP: 0.00 0 0 0.00 -
46.28/46.30 c strong branching : 39.83 1036 112344 108.44 2820.59
46.28/46.30 c (at root node) : - 22 6105 277.50 -
46.28/46.30 c conflict analysis: 0.00 0 0 0.00 -
46.28/46.30 c B&B Tree :
46.28/46.30 c number of runs : 1
46.28/46.30 c nodes : 500
46.28/46.30 c nodes (total) : 500
46.28/46.30 c nodes left : 0
46.28/46.30 c max depth : 101
46.28/46.30 c max depth (total): 101
46.28/46.30 c backtracks : 68 (13.6%)
46.28/46.30 c delayed cutoffs : 375
46.28/46.30 c repropagations : 595 (1629 domain reductions, 31 cutoffs)
46.28/46.30 c avg switch length: 7.77
46.28/46.30 c switching time : 0.12
46.28/46.30 c Solution :
46.28/46.30 c Solutions found : 0 (0 improvements)
46.28/46.30 c Primal Bound : infeasible
46.28/46.30 c Dual Bound : -
46.28/46.30 c Gap : 0.00 %
46.28/46.30 c Root Dual Bound : +0.00000000000000e+00
46.28/46.30 c Root Iterations : 1425
46.28/46.32 c Time complete: 46.3.