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: a3bf3a4-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-3690492-1338016946.opb>
0.00/0.01 c original problem has 1612 variables (1612 bin, 0 int, 0 impl, 0 cont) and 3653 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.01/0.03 c presolving:
0.01/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.01/0.07 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.01/0.07 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.01/0.08 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.01/0.08 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.01/0.08 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.01/0.09 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.01/0.09 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.01/0.09 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.08/0.10 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.08/0.10 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.08/0.11 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.08/0.11 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.08/0.11 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.08/0.11 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.08/0.12 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.08/0.12 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.08/0.12 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.08/0.12 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.08/0.13 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.08/0.13 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.08/0.13 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.08/0.13 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.08/0.14 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.08/0.14 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.08/0.14 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.08/0.14 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.08/0.15 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.08/0.15 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.08/0.17 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.08/0.18 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.08/0.19 c (round 32) 639 del vars, 3263 del conss, 599 add conss, 282 chg bounds, 199 chg sides, 405 chg coeffs, 2195 upgd conss, 61739 impls, 0 clqs
0.18/0.20 c (round 33) 682 del vars, 3306 del conss, 642 add conss, 282 chg bounds, 199 chg sides, 405 chg coeffs, 2195 upgd conss, 62953 impls, 7 clqs
0.29/0.31 c (round 34) 687 del vars, 3354 del conss, 685 add conss, 282 chg bounds, 199 chg sides, 405 chg coeffs, 2195 upgd conss, 63079 impls, 50 clqs
0.29/0.31 c (round 35) 687 del vars, 3380 del conss, 685 add conss, 282 chg bounds, 199 chg sides, 405 chg coeffs, 2195 upgd conss, 63079 impls, 51 clqs
0.29/0.32 c (round 36) 690 del vars, 3383 del conss, 685 add conss, 282 chg bounds, 199 chg sides, 405 chg coeffs, 2195 upgd conss, 63149 impls, 51 clqs
0.29/0.33 c presolving (37 rounds):
0.29/0.33 c 690 deleted vars, 3383 deleted constraints, 685 added constraints, 282 tightened bounds, 0 added holes, 199 changed sides, 405 changed coefficients
0.29/0.33 c 63149 implications, 51 cliques
0.29/0.33 c presolved problem has 922 variables (922 bin, 0 int, 0 impl, 0 cont) and 955 constraints
0.29/0.33 c 332 constraints of type <knapsack>
0.29/0.33 c 118 constraints of type <setppc>
0.29/0.33 c 497 constraints of type <and>
0.29/0.33 c 8 constraints of type <logicor>
0.29/0.33 c transformed objective value is always integral (scale: 1)
0.29/0.33 c Presolving Time: 0.31
0.29/0.33 c - non default parameters ----------------------------------------------------------------------
0.29/0.33 c # SCIP version 2.1.1.4
0.29/0.33 c
0.29/0.33 c # maximal time in seconds to run
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.33 c limits/time = 1797
0.29/0.33 c
0.29/0.33 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.33 c limits/memory = 13950
0.29/0.33 c
0.29/0.33 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.33 c limits/solutions = 1
0.29/0.33 c
0.29/0.33 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.33 c separating/maxrounds = 1
0.29/0.33 c
0.29/0.33 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.33 c separating/maxroundsroot = 5
0.29/0.33 c
0.29/0.33 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.29/0.33 c # [type: int, range: [1,2], default: 1]
0.29/0.33 c timing/clocktype = 2
0.29/0.33 c
0.29/0.33 c # belongs reading time to solving time?
0.29/0.33 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.33 c timing/reading = TRUE
0.29/0.33 c
0.29/0.33 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.33 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.33 c constraints/knapsack/disaggregation = FALSE
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/coefdiving/freq = -1
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/coefdiving/maxlpiterquot = 0.075
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/coefdiving/maxlpiterofs = 1500
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.33 c heuristics/crossover/freq = -1
0.29/0.33 c
0.29/0.33 c # number of nodes added to the contingent of the total nodes
0.29/0.33 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.33 c heuristics/crossover/nodesofs = 750
0.29/0.33 c
0.29/0.33 c # number of nodes without incumbent change that heuristic should wait
0.29/0.33 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.33 c heuristics/crossover/nwaitingnodes = 100
0.29/0.33 c
0.29/0.33 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.33 c # [type: real, range: [0,1], default: 0.1]
0.29/0.33 c heuristics/crossover/nodesquot = 0.15
0.29/0.33 c
0.29/0.33 c # minimum percentage of integer variables that have to be fixed
0.29/0.33 c # [type: real, range: [0,1], default: 0.666]
0.29/0.33 c heuristics/crossover/minfixingrate = 0.5
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.33 c heuristics/feaspump/freq = -1
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/feaspump/maxlpiterofs = 2000
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/fracdiving/freq = -1
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/fracdiving/maxlpiterquot = 0.075
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/fracdiving/maxlpiterofs = 1500
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/guideddiving/freq = -1
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/guideddiving/maxlpiterquot = 0.075
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/guideddiving/maxlpiterofs = 1500
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/intdiving/maxlpiterquot = 0.075
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/intshifting/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/linesearchdiving/freq = -1
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.33 c heuristics/objpscostdiving/freq = -1
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.33 c # [type: real, range: [0,1], default: 0.01]
0.29/0.33 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.33 c heuristics/oneopt/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/pscostdiving/freq = -1
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/pscostdiving/maxlpiterofs = 1500
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.33 c heuristics/rens/freq = -1
0.29/0.33 c
0.29/0.33 c # minimum percentage of integer variables that have to be fixable
0.29/0.33 c # [type: real, range: [0,1], default: 0.5]
0.29/0.33 c heuristics/rens/minfixingrate = 0.3
0.29/0.33 c
0.29/0.33 c # number of nodes added to the contingent of the total nodes
0.29/0.33 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.33 c heuristics/rens/nodesofs = 2000
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.33 c heuristics/rootsoldiving/freq = -1
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.33 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.33 c heuristics/rounding/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.33 c heuristics/shiftandpropagate/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/shifting/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.33 c heuristics/simplerounding/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.33 c heuristics/subnlp/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.33 c heuristics/trivial/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.33 c heuristics/trysol/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.33 c heuristics/undercover/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.33 c heuristics/veclendiving/freq = -1
0.29/0.33 c
0.29/0.33 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.33 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.33 c heuristics/veclendiving/maxlpiterquot = 0.075
0.29/0.33 c
0.29/0.33 c # additional number of allowed LP iterations
0.29/0.33 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.33 c heuristics/veclendiving/maxlpiterofs = 1500
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.33 c heuristics/zirounding/freq = -1
0.29/0.33 c
0.29/0.33 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.33 c propagating/probing/maxprerounds = 0
0.29/0.33 c
0.29/0.33 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.33 c separating/cmir/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.33 c separating/flowcover/freq = -1
0.29/0.33 c
0.29/0.33 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.33 c separating/rapidlearning/freq = 0
0.29/0.33 c
0.29/0.33 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
0.29/0.33 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.33 c heuristics/indoneopt/freq = -1
0.29/0.33 c
0.29/0.33 c -----------------------------------------------------------------------------------------------
0.29/0.33 c start solving
0.29/0.33 c
0.29/0.34 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.34 c 0.3s| 1 | 0 | 198 | - |8320k| 0 | 179 | 922 | 955 | 922 |1452 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.38/0.48 c 0.5s| 1 | 0 | 294 | - |8496k| 0 | 209 | 922 |1028 | 922 |1511 | 65 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.51 c 0.5s| 1 | 0 | 394 | - |8610k| 0 | 256 | 922 |1028 | 922 |1572 | 126 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.56 c 0.6s| 1 | 0 | 589 | - |8746k| 0 | 282 | 922 |1028 | 922 |1633 | 187 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.63 c 0.6s| 1 | 0 | 899 | - |8942k| 0 | 344 | 922 |1028 | 922 |1769 | 323 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.75 c 0.7s| 1 | 0 | 1182 | - |9468k| 0 | 365 | 922 |1028 | 922 |1932 | 486 | 0 | 0 | 0.000000e+00 | -- | Inf
0.89/0.92 c 0.9s| 1 | 2 | 1182 | - |9469k| 0 | 365 | 922 |1028 | 922 |1932 | 486 | 0 | 12 | 0.000000e+00 | -- | Inf
8.98/9.02 c 9.0s| 100 | 101 | 4586 | 34.4 |9769k| 24 | 293 | 922 |1028 | 922 |1829 | 745 | 0 |1441 | 0.000000e+00 | -- | Inf
11.48/11.58 c 11.6s| 200 | 178 | 8028 | 34.4 | 10M| 25 | 164 | 922 |1054 | 922 |1836 |1088 | 26 |2000 | 0.000000e+00 | -- | Inf
12.09/12.17 c 12.2s| 300 | 228 | 10858 | 32.4 | 10M| 25 | 220 | 922 |1080 | 922 |1830 |1266 | 52 |2087 | 0.000000e+00 | -- | Inf
12.78/12.89 c 12.9s| 400 | 242 | 14634 | 33.7 | 10M| 25 | 227 | 922 |1155 | 922 |1845 |1605 | 127 |2166 | 0.000000e+00 | -- | Inf
13.09/13.12 c 13.1s| 500 | 333 | 15664 | 29.0 | 10M| 100 | 27 | 922 |1162 | 922 |1857 |1648 | 134 |2193 | 0.000000e+00 | -- | Inf
13.38/13.43 c 13.4s| 600 | 264 | 17805 | 27.8 | 10M| 104 | 66 | 922 |1239 | 922 |1859 |1756 | 211 |2211 | 0.000000e+00 | -- | Inf
13.49/13.56 c
13.49/13.56 c SCIP Status : problem is solved [infeasible]
13.49/13.56 c Solving Time (sec) : 13.56
13.49/13.56 c Solving Nodes : 635
13.49/13.56 c Primal Bound : +1.00000000000000e+20 (0 solutions)
13.49/13.56 c Dual Bound : +1.00000000000000e+20
13.49/13.56 c Gap : 0.00 %
13.49/13.56 s UNSATISFIABLE
13.49/13.56 c SCIP Status : problem is solved [infeasible]
13.49/13.56 c Total Time : 13.56
13.49/13.56 c solving : 13.56
13.49/13.56 c presolving : 0.31 (included in solving)
13.49/13.56 c reading : 0.01 (included in solving)
13.49/13.56 c copying : 0.01 (1 #copies) (minimal 0.01, maximal 0.01, average 0.01)
13.49/13.56 c Original Problem :
13.49/13.56 c Problem name : HOME/instance-3690492-1338016946.opb
13.49/13.56 c Variables : 1612 (1612 binary, 0 integer, 0 implicit integer, 0 continuous)
13.49/13.56 c Constraints : 3653 initial, 3653 maximal
13.49/13.56 c Objective sense : minimize
13.49/13.56 c Presolved Problem :
13.49/13.56 c Problem name : t_HOME/instance-3690492-1338016946.opb
13.49/13.56 c Variables : 922 (922 binary, 0 integer, 0 implicit integer, 0 continuous)
13.49/13.56 c Constraints : 955 initial, 1290 maximal
13.49/13.56 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
13.49/13.56 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
13.49/13.56 c trivial : 0.00 0.00 1 0 0 0 0 0 0 0 0
13.49/13.56 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
13.49/13.56 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
13.49/13.56 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
13.49/13.56 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
13.49/13.56 c gateextraction : 0.00 0.00 0 0 0 0 0 1805 599 0 0
13.49/13.56 c implics : 0.01 0.00 0 274 0 0 0 0 0 0 0
13.49/13.56 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
13.49/13.56 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
13.49/13.56 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
13.49/13.56 c knapsack : 0.01 0.00 0 0 0 0 0 0 0 0 0
13.49/13.56 c setppc : 0.01 0.00 0 0 0 0 0 26 0 0 0
13.49/13.56 c and : 0.13 0.00 0 51 0 0 0 94 86 0 0
13.49/13.56 c linear : 0.12 0.00 281 83 0 282 0 1458 0 199 405
13.49/13.56 c logicor : 0.01 0.00 0 0 0 0 0 0 0 0 0
13.49/13.56 c root node : - - 7 - - 7 - - - - -
13.49/13.56 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
13.49/13.56 c integral : 0 0 0 0 622 0 1 0 21 118 0 0 1066
13.49/13.56 c knapsack : 332 332 6 3126 0 0 0 267 34 1469 1073 0 0
13.49/13.56 c setppc : 118 118 6 3092 0 0 0 901 13 1614 0 0 0
13.49/13.56 c and : 497 497 564 3079 0 0 0 2151 35 15273 1453 0 0
13.49/13.56 c linear : 0+ 77 5 3043 0 0 0 124 0 128 1 0 0
13.49/13.56 c logicor : 8+ 271 6 844 0 0 0 899 36 653 0 0 0
13.49/13.56 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0
13.49/13.56 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
13.49/13.56 c integral : 10.72 0.00 0.00 0.00 10.72 0.00 0.00 0.00
13.49/13.56 c knapsack : 0.04 0.00 0.01 0.02 0.00 0.00 0.00 0.00
13.49/13.56 c setppc : 0.01 0.00 0.00 0.01 0.00 0.00 0.00 0.00
13.49/13.56 c and : 0.06 0.00 0.02 0.03 0.00 0.00 0.00 0.00
13.49/13.56 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
13.49/13.56 c logicor : 0.01 0.00 0.00 0.01 0.00 0.00 0.00 0.00
13.49/13.56 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
13.49/13.56 c Propagators : #Propagate #ResProp Cutoffs DomReds
13.49/13.56 c rootredcost : 0 0 0 0
13.49/13.56 c pseudoobj : 0 0 0 0
13.49/13.56 c vbounds : 0 0 0 0
13.49/13.56 c redcost : 862 0 0 0
13.49/13.56 c probing : 0 0 0 0
13.49/13.56 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
13.49/13.56 c rootredcost : 0.00 0.00 0.00 0.00 0.00
13.49/13.56 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
13.49/13.56 c vbounds : 0.00 0.00 0.00 0.00 0.00
13.49/13.56 c redcost : 0.01 0.00 0.00 0.01 0.00
13.49/13.56 c probing : 0.00 0.00 0.00 0.00 0.00
13.49/13.56 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
13.49/13.56 c propagation : 0.01 117 110 342 9.3 17 4.9 -
13.49/13.56 c infeasible LP : 0.00 16 16 43 5.9 4 2.5 0
13.49/13.56 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
13.49/13.56 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
13.49/13.56 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
13.49/13.56 c applied globally : - - - 262 6.8 - - -
13.49/13.56 c applied locally : - - - 0 0.0 - - -
13.49/13.56 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
13.49/13.56 c cut pool : 0.00 4 - - 50 - (maximal pool size: 764)
13.49/13.56 c closecuts : 0.00 0.00 0 0 0 0 0
13.49/13.56 c impliedbounds : 0.00 0.00 5 0 0 314 0
13.49/13.56 c intobj : 0.00 0.00 0 0 0 0 0
13.49/13.56 c gomory : 0.08 0.00 5 0 0 231 0
13.49/13.56 c cgmip : 0.00 0.00 0 0 0 0 0
13.49/13.56 c strongcg : 0.11 0.00 5 0 0 1642 0
13.49/13.56 c cmir : 0.00 0.00 0 0 0 0 0
13.49/13.56 c flowcover : 0.00 0.00 0 0 0 0 0
13.49/13.56 c clique : 0.02 0.00 5 0 0 28 0
13.49/13.56 c zerohalf : 0.00 0.00 0 0 0 0 0
13.49/13.56 c mcf : 0.00 0.00 1 0 0 0 0
13.49/13.56 c oddcycle : 0.00 0.00 0 0 0 0 0
13.49/13.56 c rapidlearning : 0.09 0.00 1 0 3 0 77
13.49/13.56 c Pricers : ExecTime SetupTime Calls Vars
13.49/13.56 c problem variables: 0.00 - 0 0
13.49/13.56 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
13.49/13.56 c relpscost : 10.72 0.00 622 21 118 0 0 1066
13.49/13.56 c pscost : 0.00 0.00 0 0 0 0 0 0
13.49/13.56 c inference : 0.00 0.00 0 0 0 0 0 0
13.49/13.56 c mostinf : 0.00 0.00 0 0 0 0 0 0
13.49/13.56 c leastinf : 0.00 0.00 0 0 0 0 0 0
13.49/13.56 c fullstrong : 0.00 0.00 0 0 0 0 0 0
13.49/13.56 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
13.49/13.56 c random : 0.00 0.00 0 0 0 0 0 0
13.49/13.56 c Primal Heuristics : ExecTime SetupTime Calls Found
13.49/13.56 c LP solutions : 0.00 - - 0
13.49/13.56 c pseudo solutions : 0.00 - - 0
13.49/13.56 c smallcard : 0.00 0.00 0 0
13.49/13.56 c trivial : 0.00 0.00 1 0
13.49/13.56 c shiftandpropagate: 0.00 0.00 0 0
13.49/13.56 c simplerounding : 0.00 0.00 0 0
13.49/13.56 c zirounding : 0.00 0.00 0 0
13.49/13.56 c rounding : 0.00 0.00 0 0
13.49/13.56 c shifting : 0.00 0.00 0 0
13.49/13.56 c intshifting : 0.00 0.00 0 0
13.49/13.56 c oneopt : 0.00 0.00 0 0
13.49/13.56 c twoopt : 0.00 0.00 0 0
13.49/13.56 c indtwoopt : 0.00 0.00 0 0
13.49/13.56 c indoneopt : 0.00 0.00 0 0
13.49/13.56 c fixandinfer : 0.00 0.00 0 0
13.49/13.56 c feaspump : 0.00 0.00 0 0
13.49/13.56 c clique : 0.00 0.00 0 0
13.49/13.56 c indrounding : 0.00 0.00 0 0
13.49/13.56 c indcoefdiving : 0.00 0.00 0 0
13.49/13.56 c coefdiving : 0.00 0.00 0 0
13.49/13.56 c pscostdiving : 0.00 0.00 0 0
13.49/13.56 c nlpdiving : 0.00 0.00 0 0
13.49/13.56 c fracdiving : 0.00 0.00 0 0
13.49/13.56 c veclendiving : 0.00 0.00 0 0
13.49/13.56 c intdiving : 0.00 0.00 0 0
13.49/13.56 c actconsdiving : 0.00 0.00 0 0
13.49/13.56 c objpscostdiving : 0.00 0.00 0 0
13.49/13.56 c rootsoldiving : 0.00 0.00 0 0
13.49/13.56 c linesearchdiving : 0.00 0.00 0 0
13.49/13.56 c guideddiving : 0.00 0.00 0 0
13.49/13.56 c octane : 0.00 0.00 0 0
13.49/13.56 c rens : 0.00 0.00 0 0
13.49/13.56 c rins : 0.00 0.00 0 0
13.49/13.56 c localbranching : 0.00 0.00 0 0
13.49/13.56 c mutation : 0.00 0.00 0 0
13.49/13.56 c crossover : 0.00 0.00 0 0
13.49/13.56 c dins : 0.00 0.00 0 0
13.49/13.56 c vbounds : 0.00 0.00 0 0
13.49/13.56 c undercover : 0.00 0.00 0 0
13.49/13.56 c subnlp : 0.00 0.00 0 0
13.49/13.56 c trysol : 0.00 0.00 0 0
13.49/13.56 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
13.49/13.56 c primal LP : 0.00 1 0 0.00 - 0.00 1
13.49/13.56 c dual LP : 1.72 879 18492 21.09 10776.15 0.00 2
13.49/13.56 c lex dual LP : 0.00 0 0 0.00 -
13.49/13.56 c barrier LP : 0.00 0 0 0.00 - 0.00 0
13.49/13.56 c diving/probing LP: 0.00 0 0 0.00 -
13.49/13.56 c strong branching : 10.64 2219 101047 45.54 9494.47
13.49/13.56 c (at root node) : - 12 1583 131.92 -
13.49/13.56 c conflict analysis: 0.00 0 0 0.00 -
13.49/13.56 c B&B Tree :
13.49/13.56 c number of runs : 1
13.49/13.56 c nodes : 635
13.49/13.56 c nodes (total) : 635
13.49/13.56 c nodes left : 0
13.49/13.56 c max depth : 104
13.49/13.56 c max depth (total): 104
13.49/13.56 c backtracks : 102 (16.1%)
13.49/13.56 c delayed cutoffs : 432
13.49/13.56 c repropagations : 311 (4076 domain reductions, 55 cutoffs)
13.49/13.56 c avg switch length: 3.82
13.49/13.56 c switching time : 0.06
13.49/13.56 c Solution :
13.49/13.56 c Solutions found : 0 (0 improvements)
13.49/13.56 c Primal Bound : infeasible
13.49/13.56 c Dual Bound : -
13.49/13.56 c Gap : 0.00 %
13.49/13.56 c Root Dual Bound : +0.00000000000000e+00
13.49/13.56 c Root Iterations : 1182
13.49/13.57 c Time complete: 13.56.