0.00/0.00 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
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-3485868-1307753776.opb>
0.00/0.02 c original problem has 1612 variables (1612 bin, 0 int, 0 impl, 0 cont) and 3653 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.03 c presolving:
0.00/0.06 c (round 1) 215 del vars, 150 del conss, 0 add conss, 49 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 57928 impls, 0 clqs
0.00/0.06 c (round 2) 217 del vars, 498 del conss, 0 add conss, 51 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 57928 impls, 0 clqs
0.00/0.06 c (round 3) 236 del vars, 522 del conss, 0 add conss, 61 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58276 impls, 0 clqs
0.00/0.06 c (round 4) 243 del vars, 552 del conss, 0 add conss, 65 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58316 impls, 0 clqs
0.00/0.06 c (round 5) 255 del vars, 574 del conss, 0 add conss, 71 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58394 impls, 0 clqs
0.00/0.06 c (round 6) 269 del vars, 606 del conss, 0 add conss, 79 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58496 impls, 0 clqs
0.00/0.06 c (round 7) 293 del vars, 663 del conss, 0 add conss, 98 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58598 impls, 0 clqs
0.00/0.07 c (round 8) 317 del vars, 718 del conss, 0 add conss, 112 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58904 impls, 0 clqs
0.00/0.07 c (round 9) 334 del vars, 776 del conss, 0 add conss, 129 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 58936 impls, 0 clqs
0.00/0.07 c (round 10) 419 del vars, 967 del conss, 0 add conss, 194 chg bounds, 190 chg sides, 394 chg coeffs, 0 upgd conss, 59680 impls, 0 clqs
0.00/0.07 c (round 11) 454 del vars, 1071 del conss, 0 add conss, 219 chg bounds, 194 chg sides, 398 chg coeffs, 0 upgd conss, 60363 impls, 0 clqs
0.00/0.07 c (round 12) 474 del vars, 1137 del conss, 0 add conss, 225 chg bounds, 194 chg sides, 398 chg coeffs, 0 upgd conss, 60609 impls, 0 clqs
0.00/0.07 c (round 13) 477 del vars, 1170 del conss, 0 add conss, 227 chg bounds, 194 chg sides, 398 chg coeffs, 0 upgd conss, 60695 impls, 0 clqs
0.00/0.07 c (round 14) 485 del vars, 1187 del conss, 0 add conss, 232 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 60952 impls, 0 clqs
0.00/0.07 c (round 15) 501 del vars, 1223 del conss, 0 add conss, 243 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61346 impls, 0 clqs
0.00/0.08 c (round 16) 513 del vars, 1258 del conss, 0 add conss, 250 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61358 impls, 0 clqs
0.00/0.08 c (round 17) 517 del vars, 1280 del conss, 0 add conss, 252 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61364 impls, 0 clqs
0.00/0.08 c (round 18) 520 del vars, 1290 del conss, 0 add conss, 254 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61368 impls, 0 clqs
0.00/0.08 c (round 19) 522 del vars, 1297 del conss, 0 add conss, 256 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61370 impls, 0 clqs
0.00/0.08 c (round 20) 524 del vars, 1303 del conss, 0 add conss, 258 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61372 impls, 0 clqs
0.00/0.08 c (round 21) 528 del vars, 1309 del conss, 0 add conss, 262 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61372 impls, 0 clqs
0.00/0.08 c (round 22) 534 del vars, 1323 del conss, 0 add conss, 268 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61392 impls, 0 clqs
0.00/0.08 c (round 23) 544 del vars, 1346 del conss, 0 add conss, 272 chg bounds, 196 chg sides, 400 chg coeffs, 0 upgd conss, 61475 impls, 0 clqs
0.00/0.08 c (round 24) 550 del vars, 1368 del conss, 0 add conss, 275 chg bounds, 197 chg sides, 401 chg coeffs, 0 upgd conss, 61512 impls, 0 clqs
0.00/0.08 c (round 25) 554 del vars, 1382 del conss, 0 add conss, 277 chg bounds, 198 chg sides, 403 chg coeffs, 0 upgd conss, 61524 impls, 0 clqs
0.00/0.08 c (round 26) 561 del vars, 1404 del conss, 0 add conss, 280 chg bounds, 199 chg sides, 405 chg coeffs, 0 upgd conss, 61707 impls, 0 clqs
0.00/0.08 c (round 27) 566 del vars, 1420 del conss, 0 add conss, 282 chg bounds, 199 chg sides, 405 chg coeffs, 0 upgd conss, 61731 impls, 0 clqs
0.00/0.08 c (round 28) 567 del vars, 1427 del conss, 0 add conss, 282 chg bounds, 199 chg sides, 405 chg coeffs, 0 upgd conss, 61739 impls, 0 clqs
0.00/0.08 c (round 29) 567 del vars, 1429 del conss, 0 add conss, 282 chg bounds, 199 chg sides, 405 chg coeffs, 0 upgd conss, 61739 impls, 0 clqs
0.09/0.10 c (round 30) 567 del vars, 1446 del conss, 0 add conss, 282 chg bounds, 199 chg sides, 405 chg coeffs, 2195 upgd conss, 61739 impls, 0 clqs
0.09/0.11 c (round 31) 639 del vars, 1458 del conss, 0 add conss, 282 chg bounds, 199 chg sides, 405 chg coeffs, 2195 upgd conss, 61739 impls, 0 clqs
0.09/0.11 c presolving (32 rounds):
0.09/0.11 c 639 deleted vars, 1458 deleted constraints, 0 added constraints, 282 tightened bounds, 0 added holes, 199 changed sides, 405 changed coefficients
0.09/0.11 c 61739 implications, 0 cliques
0.09/0.11 c presolved problem has 973 variables (973 bin, 0 int, 0 impl, 0 cont) and 2195 constraints
0.09/0.11 c 332 constraints of type <knapsack>
0.09/0.11 c 1256 constraints of type <setppc>
0.09/0.11 c 607 constraints of type <logicor>
0.09/0.11 c transformed objective value is always integral (scale: 1)
0.09/0.11 c Presolving Time: 0.09
0.09/0.11 c - non default parameters ----------------------------------------------------------------------
0.09/0.11 c # SCIP version 2.0.1.4
0.09/0.11 c
0.09/0.11 c # frequency for displaying node information lines
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.11 c display/freq = 10000
0.09/0.11 c
0.09/0.11 c # maximal time in seconds to run
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.11 c limits/time = 1797
0.09/0.11 c
0.09/0.11 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.11 c limits/memory = 13950
0.09/0.11 c
0.09/0.11 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.11 c limits/solutions = 1
0.09/0.11 c
0.09/0.11 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.11 c separating/maxrounds = 1
0.09/0.11 c
0.09/0.11 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.11 c separating/maxroundsroot = 5
0.09/0.11 c
0.09/0.11 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.09/0.11 c # [type: int, range: [1,2], default: 1]
0.09/0.11 c timing/clocktype = 2
0.09/0.11 c
0.09/0.11 c # belongs reading time to solving time?
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c timing/reading = TRUE
0.09/0.11 c
0.09/0.11 c # should presolving try to simplify inequalities
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/linear/simplifyinequalities = TRUE
0.09/0.11 c
0.09/0.11 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/indicator/addCouplingCons = TRUE
0.09/0.11 c
0.09/0.11 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.11 c constraints/knapsack/disaggregation = FALSE
0.09/0.11 c
0.09/0.11 c # should presolving try to simplify knapsacks
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.11 c
0.09/0.11 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.11 c presolving/probing/maxrounds = 0
0.09/0.11 c
0.09/0.11 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/coefdiving/freq = -1
0.09/0.11 c
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.11 c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.11 c
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.11 c
0.09/0.11 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.11 c heuristics/crossover/freq = -1
0.09/0.11 c
0.09/0.11 c # number of nodes added to the contingent of the total nodes
0.09/0.11 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.11 c heuristics/crossover/nodesofs = 750
0.09/0.11 c
0.09/0.11 c # number of nodes without incumbent change that heuristic should wait
0.09/0.11 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.11 c heuristics/crossover/nwaitingnodes = 100
0.09/0.11 c
0.09/0.11 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.11 c # [type: real, range: [0,1], default: 0.1]
0.09/0.11 c heuristics/crossover/nodesquot = 0.15
0.09/0.11 c
0.09/0.11 c # minimum percentage of integer variables that have to be fixed
0.09/0.11 c # [type: real, range: [0,1], default: 0.666]
0.09/0.11 c heuristics/crossover/minfixingrate = 0.5
0.09/0.11 c
0.09/0.11 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.11 c heuristics/feaspump/freq = -1
0.09/0.11 c
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.11 c
0.09/0.11 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/fracdiving/freq = -1
0.09/0.11 c
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.11 c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.11 c
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.11 c
0.09/0.11 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/guideddiving/freq = -1
0.09/0.11 c
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.11 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.11 c
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.11 c
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.11 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.11 c
0.09/0.11 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/intshifting/freq = -1
0.09/0.11 c
0.09/0.11 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/linesearchdiving/freq = -1
0.09/0.11 c
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.11 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.11 c
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.11 c
0.09/0.11 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.11 c heuristics/objpscostdiving/freq = -1
0.09/0.11 c
0.09/0.11 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.11 c # [type: real, range: [0,1], default: 0.01]
0.09/0.11 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.11 c
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.11 c
0.09/0.11 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.11 c heuristics/oneopt/freq = -1
0.09/0.11 c
0.09/0.11 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/pscostdiving/freq = -1
0.09/0.11 c
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.11 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.11 c
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.11 c
0.09/0.11 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.11 c heuristics/rens/freq = -1
0.09/0.11 c
0.09/0.11 c # minimum percentage of integer variables that have to be fixable
0.09/0.11 c # [type: real, range: [0,1], default: 0.5]
0.09/0.11 c heuristics/rens/minfixingrate = 0.3
0.09/0.11 c
0.09/0.11 c # number of nodes added to the contingent of the total nodes
0.09/0.11 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.11 c heuristics/rens/nodesofs = 2000
0.09/0.11 c
0.09/0.11 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.11 c heuristics/rootsoldiving/freq = -1
0.09/0.11 c
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.11 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.11 c
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.11 c
0.09/0.11 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.11 c heuristics/rounding/freq = -1
0.09/0.11 c
0.09/0.11 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.11 c heuristics/shiftandpropagate/freq = -1
0.09/0.11 c
0.09/0.11 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/shifting/freq = -1
0.09/0.11 c
0.09/0.11 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.11 c heuristics/simplerounding/freq = -1
0.09/0.11 c
0.09/0.11 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.11 c heuristics/subnlp/freq = -1
0.09/0.11 c
0.09/0.11 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.11 c heuristics/trivial/freq = -1
0.09/0.11 c
0.09/0.11 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.11 c heuristics/trysol/freq = -1
0.09/0.11 c
0.09/0.11 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.11 c heuristics/undercover/freq = -1
0.09/0.11 c
0.09/0.11 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/veclendiving/freq = -1
0.09/0.11 c
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.11 c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.11 c
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.11 c
0.09/0.11 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.11 c heuristics/zirounding/freq = -1
0.09/0.11 c
0.09/0.11 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.11 c separating/cmir/freq = -1
0.09/0.11 c
0.09/0.11 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.11 c separating/flowcover/freq = -1
0.09/0.11 c
0.09/0.11 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.11 c separating/rapidlearning/freq = 0
0.09/0.11 c
0.09/0.11 c -----------------------------------------------------------------------------------------------
0.09/0.11 c start solving
0.09/0.11 c
0.09/0.13 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.13 c 0.1s| 1 | 0 | 215 | - |8129k| 0 | 163 | 973 |2195 | 973 |2195 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 443 | - |8189k| 0 | 314 | 973 |2215 | 973 |2222 | 39 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.3s| 1 | 0 | 618 | - |8449k| 0 | 329 | 973 |2215 | 973 |2325 | 142 | 0 | 0 | 0.000000e+00 | -- | Inf
0.28/0.39 c 0.4s| 1 | 0 | 918 | - |8732k| 0 | 294 | 973 |2215 | 973 |2396 | 213 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.50 c 0.5s| 1 | 0 | 1197 | - |8863k| 0 | 347 | 973 |2215 | 973 |2479 | 296 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.63 c 0.6s| 1 | 0 | 1568 | - |8939k| 0 | 395 | 973 |2215 | 973 |2533 | 350 | 0 | 0 | 0.000000e+00 | -- | Inf
1.19/1.24 c 1.2s| 1 | 2 | 1568 | - |8940k| 0 | 395 | 973 |2215 | 973 |2533 | 350 | 0 | 10 | 0.000000e+00 | -- | Inf
16.99/17.08 c
16.99/17.08 c SCIP Status : problem is solved [infeasible]
16.99/17.08 c Solving Time (sec) : 17.08
16.99/17.08 c Solving Nodes : 922
16.99/17.08 c Primal Bound : +1.00000000000000e+20 (0 solutions)
16.99/17.08 c Dual Bound : +1.00000000000000e+20
16.99/17.08 c Gap : 0.00 %
16.99/17.08 s UNSATISFIABLE
16.99/17.08 c SCIP Status : problem is solved [infeasible]
16.99/17.08 c Total Time : 17.08
16.99/17.08 c solving : 17.08
16.99/17.08 c presolving : 0.09 (included in solving)
16.99/17.08 c reading : 0.02 (included in solving)
16.99/17.08 c Original Problem :
16.99/17.08 c Problem name : HOME/instance-3485868-1307753776.opb
16.99/17.08 c Variables : 1612 (1612 binary, 0 integer, 0 implicit integer, 0 continuous)
16.99/17.08 c Constraints : 3653 initial, 3653 maximal
16.99/17.08 c Presolved Problem :
16.99/17.08 c Problem name : t_HOME/instance-3485868-1307753776.opb
16.99/17.08 c Variables : 973 (973 binary, 0 integer, 0 implicit integer, 0 continuous)
16.99/17.08 c Constraints : 2195 initial, 2268 maximal
16.99/17.08 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
16.99/17.08 c trivial : 0.00 1 0 0 0 0 0 0 0 0
16.99/17.08 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
16.99/17.08 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
16.99/17.08 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
16.99/17.08 c implics : 0.01 0 274 0 0 0 0 0 0 0
16.99/17.08 c probing : 0.00 0 0 0 0 0 0 0 0 0
16.99/17.08 c knapsack : 0.00 0 0 0 0 0 0 0 0 0
16.99/17.08 c setppc : 0.01 0 0 0 0 0 0 0 0 0
16.99/17.08 c linear : 0.05 281 83 0 282 0 1458 0 199 405
16.99/17.08 c logicor : 0.01 0 0 0 0 0 0 0 0 0
16.99/17.08 c root node : - 86 - - 86 - - - - -
16.99/17.08 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
16.99/17.08 c integral : 0 0 0 909 0 1 0 17 115 0 0 1686
16.99/17.08 c knapsack : 332 6 2655 0 0 0 267 28 897 1106 0 0
16.99/17.08 c setppc : 1256 6 2627 0 0 0 1345 15 5298 0 0 0
16.99/17.08 c linear : 0+ 5 1490 0 0 0 46 0 90 11 0 0
16.99/17.08 c logicor : 607+ 6 1516 0 0 0 1073 38 2138 0 0 0
16.99/17.08 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
16.99/17.08 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
16.99/17.08 c integral : 13.29 0.00 0.00 13.29 0.00 0.00 0.00
16.99/17.08 c knapsack : 0.03 0.01 0.02 0.00 0.00 0.00 0.00
16.99/17.08 c setppc : 0.02 0.00 0.02 0.00 0.00 0.00 0.00
16.99/17.08 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
16.99/17.08 c logicor : 0.01 0.00 0.01 0.00 0.00 0.00 0.00
16.99/17.08 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
16.99/17.08 c Propagators : #Propagate #Resprop Cutoffs DomReds
16.99/17.08 c vbounds : 0 0 0 0
16.99/17.08 c rootredcost : 0 0 0 0
16.99/17.08 c pseudoobj : 0 0 0 0
16.99/17.08 c Propagator Timings : TotalTime Propagate Resprop
16.99/17.08 c vbounds : 0.00 0.00 0.00
16.99/17.08 c rootredcost : 0.00 0.00 0.00
16.99/17.08 c pseudoobj : 0.00 0.00 0.00
16.99/17.08 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
16.99/17.08 c propagation : 0.00 81 81 235 8.3 34 4.2 -
16.99/17.08 c infeasible LP : 0.00 11 11 23 3.2 3 3.0 0
16.99/17.08 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
16.99/17.08 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
16.99/17.08 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
16.99/17.08 c applied globally : - - - 181 5.9 - - -
16.99/17.08 c applied locally : - - - 0 0.0 - - -
16.99/17.08 c Separators : Time Calls Cutoffs DomReds Cuts Conss
16.99/17.08 c cut pool : 0.00 4 - - 71 - (maximal pool size: 542)
16.99/17.08 c redcost : 0.01 868 0 0 0 0
16.99/17.08 c impliedbounds : 0.00 5 0 0 0 0
16.99/17.08 c intobj : 0.00 0 0 0 0 0
16.99/17.08 c gomory : 0.15 5 0 0 1194 0
16.99/17.08 c cgmip : 0.00 0 0 0 0 0
16.99/17.08 c closecuts : 0.00 0 0 0 0 0
16.99/17.08 c strongcg : 0.13 5 0 0 1573 0
16.99/17.08 c cmir : 0.00 0 0 0 0 0
16.99/17.08 c flowcover : 0.00 0 0 0 0 0
16.99/17.08 c clique : 0.01 5 0 0 35 0
16.99/17.08 c zerohalf : 0.00 0 0 0 0 0
16.99/17.08 c mcf : 0.00 1 0 0 0 0
16.99/17.08 c oddcycle : 0.00 0 0 0 0 0
16.99/17.08 c rapidlearning : 0.05 1 0 3 0 33
16.99/17.08 c Pricers : Time Calls Vars
16.99/17.08 c problem variables: 0.00 0 0
16.99/17.08 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
16.99/17.08 c relpscost : 13.29 909 17 115 0 0 1686
16.99/17.08 c pscost : 0.00 0 0 0 0 0 0
16.99/17.08 c inference : 0.00 0 0 0 0 0 0
16.99/17.08 c mostinf : 0.00 0 0 0 0 0 0
16.99/17.08 c leastinf : 0.00 0 0 0 0 0 0
16.99/17.08 c fullstrong : 0.00 0 0 0 0 0 0
16.99/17.08 c allfullstrong : 0.00 0 0 0 0 0 0
16.99/17.08 c random : 0.00 0 0 0 0 0 0
16.99/17.08 c Primal Heuristics : Time Calls Found
16.99/17.08 c LP solutions : 0.00 - 0
16.99/17.08 c pseudo solutions : 0.00 - 0
16.99/17.08 c trivial : 0.00 1 0
16.99/17.08 c shiftandpropagate: 0.00 0 0
16.99/17.08 c simplerounding : 0.00 0 0
16.99/17.08 c zirounding : 0.00 0 0
16.99/17.08 c rounding : 0.00 0 0
16.99/17.08 c shifting : 0.00 0 0
16.99/17.08 c intshifting : 0.00 0 0
16.99/17.08 c oneopt : 0.00 0 0
16.99/17.08 c twoopt : 0.00 0 0
16.99/17.08 c fixandinfer : 0.00 0 0
16.99/17.08 c feaspump : 0.00 0 0
16.99/17.08 c clique : 0.00 0 0
16.99/17.08 c coefdiving : 0.00 0 0
16.99/17.08 c pscostdiving : 0.00 0 0
16.99/17.08 c fracdiving : 0.00 0 0
16.99/17.08 c veclendiving : 0.00 0 0
16.99/17.08 c intdiving : 0.00 0 0
16.99/17.08 c actconsdiving : 0.00 0 0
16.99/17.08 c objpscostdiving : 0.00 0 0
16.99/17.08 c rootsoldiving : 0.00 0 0
16.99/17.08 c linesearchdiving : 0.00 0 0
16.99/17.08 c guideddiving : 0.00 0 0
16.99/17.08 c octane : 0.00 0 0
16.99/17.08 c rens : 0.00 0 0
16.99/17.08 c rins : 0.00 0 0
16.99/17.08 c localbranching : 0.00 0 0
16.99/17.08 c mutation : 0.00 0 0
16.99/17.08 c crossover : 0.00 0 0
16.99/17.08 c dins : 0.00 0 0
16.99/17.08 c vbounds : 0.00 0 0
16.99/17.08 c undercover : 0.00 0 0
16.99/17.08 c subnlp : 0.00 0 0
16.99/17.08 c trysol : 0.00 0 0
16.99/17.08 c LP : Time Calls Iterations Iter/call Iter/sec
16.99/17.08 c primal LP : 0.00 0 0 0.00 -
16.99/17.08 c dual LP : 2.93 924 28068 30.38 9588.87
16.99/17.08 c lex dual LP : 0.00 0 0 0.00 -
16.99/17.08 c barrier LP : 0.00 0 0 0.00 -
16.99/17.08 c diving/probing LP: 0.00 0 0 0.00 -
16.99/17.08 c strong branching : 13.21 2201 108666 49.37 8223.57
16.99/17.08 c (at root node) : - 10 5256 525.60 -
16.99/17.08 c conflict analysis: 0.00 0 0 0.00 -
16.99/17.08 c B&B Tree :
16.99/17.08 c number of runs : 1
16.99/17.08 c nodes : 922
16.99/17.08 c nodes (total) : 922
16.99/17.08 c nodes left : 0
16.99/17.08 c max depth : 85
16.99/17.08 c max depth (total): 85
16.99/17.08 c backtracks : 71 (7.7%)
16.99/17.08 c delayed cutoffs : 765
16.99/17.08 c repropagations : 341 (1727 domain reductions, 30 cutoffs)
16.99/17.08 c avg switch length: 2.73
16.99/17.08 c switching time : 0.06
16.99/17.08 c Solution :
16.99/17.08 c Solutions found : 0 (0 improvements)
16.99/17.08 c Primal Bound : infeasible
16.99/17.08 c Dual Bound : -
16.99/17.08 c Gap : 0.00 %
16.99/17.08 c Root Dual Bound : +0.00000000000000e+00
16.99/17.08 c Root Iterations : 1568
16.99/17.09 c Time complete: 17.09.