0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [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-2664541-1276330846.opb>
0.01/0.07 c original problem has 1612 variables (1612 bin, 0 int, 0 impl, 0 cont) and 3653 constraints
0.01/0.07 c problem read
0.01/0.07 c No objective function, only one solution is needed.
0.01/0.08 c presolving settings loaded
0.01/0.08 c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.01/0.10 c presolving:
0.09/0.16 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.17 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.22 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.25 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.26 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.27 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.29/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.31 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.22
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.94
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 # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.40 c lp/solvefreq = -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.41 c heuristics/feaspump/maxlpiterofs = 2000
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41 c heuristics/fracdiving/freq = -1
0.39/0.41 c
0.39/0.41 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.41 c heuristics/fracdiving/maxlpiterquot = 0.075
0.39/0.41 c
0.39/0.41 c # additional number of allowed LP iterations
0.39/0.41 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41 c heuristics/fracdiving/maxlpiterofs = 1500
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41 c heuristics/guideddiving/freq = -1
0.39/0.41 c
0.39/0.41 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.41 c heuristics/guideddiving/maxlpiterquot = 0.075
0.39/0.41 c
0.39/0.41 c # additional number of allowed LP iterations
0.39/0.41 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41 c heuristics/guideddiving/maxlpiterofs = 1500
0.39/0.41 c
0.39/0.41 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.41 c heuristics/intdiving/maxlpiterquot = 0.075
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41 c heuristics/intshifting/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41 c heuristics/linesearchdiving/freq = -1
0.39/0.41 c
0.39/0.41 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.41 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.39/0.41 c
0.39/0.41 c # additional number of allowed LP iterations
0.39/0.41 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.41 c heuristics/nlp/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.41 c heuristics/objpscostdiving/freq = -1
0.39/0.41 c
0.39/0.41 c # maximal fraction of diving LP iterations compared to total iteration number
0.39/0.41 c # [type: real, range: [0,1], default: 0.01]
0.39/0.41 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.39/0.41 c
0.39/0.41 c # additional number of allowed LP iterations
0.39/0.41 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.41 c heuristics/oneopt/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41 c heuristics/pscostdiving/freq = -1
0.39/0.41 c
0.39/0.41 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.41 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.39/0.41 c
0.39/0.41 c # additional number of allowed LP iterations
0.39/0.41 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41 c heuristics/pscostdiving/maxlpiterofs = 1500
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.41 c heuristics/rens/freq = -1
0.39/0.41 c
0.39/0.41 c # minimum percentage of integer variables that have to be fixable
0.39/0.41 c # [type: real, range: [0,1], default: 0.5]
0.39/0.41 c heuristics/rens/minfixingrate = 0.3
0.39/0.41 c
0.39/0.41 c # number of nodes added to the contingent of the total nodes
0.39/0.41 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.41 c heuristics/rens/nodesofs = 2000
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.41 c heuristics/rootsoldiving/freq = -1
0.39/0.41 c
0.39/0.41 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.39/0.41 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.39/0.41 c
0.39/0.41 c # additional number of allowed LP iterations
0.39/0.41 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.41 c heuristics/rounding/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41 c heuristics/shifting/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.41 c heuristics/simplerounding/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.41 c heuristics/trivial/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.41 c heuristics/trysol/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.41 c heuristics/veclendiving/freq = -1
0.39/0.41 c
0.39/0.41 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.41 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.41 c heuristics/veclendiving/maxlpiterquot = 0.075
0.39/0.41 c
0.39/0.41 c # additional number of allowed LP iterations
0.39/0.41 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.41 c heuristics/veclendiving/maxlpiterofs = 1500
0.39/0.41 c
0.39/0.41 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.41 c heuristics/zirounding/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.41 c separating/cmir/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.41 c separating/flowcover/freq = -1
0.39/0.41 c
0.39/0.41 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.39/0.41 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.41 c separating/rapidlearning/freq = 0
0.39/0.41 c
0.39/0.41 c -----------------------------------------------------------------------------------------------
0.39/0.41 c start solving
0.39/0.41 c
0.39/0.41 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.41 c 0.2s| 1 | 2 | 0 | - |6879k| 0 | - | 973 |2195 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1.49/1.50 c
1.49/1.50 c SCIP Status : problem is solved [infeasible]
1.49/1.50 c Solving Time (sec) : 1.26
1.49/1.50 c Solving Nodes : 1687
1.49/1.50 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1.49/1.50 c Dual Bound : +1.00000000000000e+20
1.49/1.50 c Gap : 0.00 %
1.49/1.50 s UNSATISFIABLE
1.49/1.50 c SCIP Status : problem is solved [infeasible]
1.49/1.50 c Solving Time : 1.26
1.49/1.50 c Original Problem :
1.49/1.50 c Problem name : HOME/instance-2664541-1276330846.opb
1.49/1.50 c Variables : 1612 (1612 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.50 c Constraints : 3653 initial, 3653 maximal
1.49/1.50 c Presolved Problem :
1.49/1.50 c Problem name : t_HOME/instance-2664541-1276330846.opb
1.49/1.50 c Variables : 973 (973 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.50 c Constraints : 2195 initial, 2696 maximal
1.49/1.50 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.49/1.50 c trivial : 0.01 1 0 0 0 0 0 0 0
1.49/1.50 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.49/1.50 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.49/1.50 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.49/1.50 c implics : 0.02 0 274 0 0 0 0 0 0
1.49/1.50 c probing : 0.00 0 0 0 0 0 0 0 0
1.49/1.50 c knapsack : 0.00 0 0 0 0 0 0 0 0
1.49/1.50 c linear : 0.13 281 83 0 282 0 1458 199 405
1.49/1.50 c logicor : 0.04 0 0 0 0 0 0 0 0
1.49/1.50 c root node : - 420 - - 420 - - - -
1.49/1.50 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.49/1.50 c integral : 0 0 0 0 0 0 0 0 0 0
1.49/1.50 c knapsack : 332 0 8474 0 1416 209 4209 0 0 0
1.49/1.50 c logicor : 1863+ 0 6930 0 1416 244 18403 0 0 0
1.49/1.50 c countsols : 0 0 0 0 1416 0 0 0 0 0
1.49/1.50 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.49/1.50 c integral : 0.00 0.00 0.00 0.00 0.00
1.49/1.50 c knapsack : 0.21 0.00 0.21 0.00 0.00
1.49/1.50 c logicor : 0.39 0.00 0.13 0.00 0.26
1.49/1.50 c countsols : 0.00 0.00 0.00 0.00 0.00
1.49/1.50 c Propagators : Time Calls Cutoffs DomReds
1.49/1.50 c vbounds : 0.01 1 0 0
1.49/1.50 c rootredcost : 0.00 0 0 0
1.49/1.50 c pseudoobj : 0.01 0 0 0
1.49/1.50 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.49/1.50 c propagation : 0.00 453 451 1562 9.0 119 4.4 -
1.49/1.50 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.50 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.50 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.50 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.49/1.50 c applied globally : - - - 858 6.8 - - -
1.49/1.50 c applied locally : - - - 0 0.0 - - -
1.49/1.50 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.49/1.50 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.49/1.50 c redcost : 0.00 0 0 0 0 0
1.49/1.50 c impliedbounds : 0.00 0 0 0 0 0
1.49/1.50 c intobj : 0.00 0 0 0 0 0
1.49/1.50 c cgmip : 0.00 0 0 0 0 0
1.49/1.50 c gomory : 0.00 0 0 0 0 0
1.49/1.50 c strongcg : 0.00 0 0 0 0 0
1.49/1.50 c cmir : 0.00 0 0 0 0 0
1.49/1.50 c flowcover : 0.00 0 0 0 0 0
1.49/1.50 c clique : 0.00 0 0 0 0 0
1.49/1.50 c zerohalf : 0.00 0 0 0 0 0
1.49/1.50 c mcf : 0.00 0 0 0 0 0
1.49/1.50 c rapidlearning : 0.00 0 0 0 0 0
1.49/1.50 c Pricers : Time Calls Vars
1.49/1.50 c problem variables: 0.00 0 0
1.49/1.50 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.49/1.50 c relpscost : 0.00 0 0 0 0 0 0
1.49/1.50 c pscost : 0.00 0 0 0 0 0 0
1.49/1.50 c inference : 0.15 1416 0 0 0 0 2832
1.49/1.50 c mostinf : 0.00 0 0 0 0 0 0
1.49/1.50 c leastinf : 0.00 0 0 0 0 0 0
1.49/1.50 c fullstrong : 0.00 0 0 0 0 0 0
1.49/1.50 c allfullstrong : 0.00 0 0 0 0 0 0
1.49/1.50 c random : 0.00 0 0 0 0 0 0
1.49/1.50 c Primal Heuristics : Time Calls Found
1.49/1.50 c LP solutions : 0.00 - 0
1.49/1.50 c pseudo solutions : 0.00 - 0
1.49/1.50 c trivial : 0.00 1 0
1.49/1.50 c simplerounding : 0.00 0 0
1.49/1.50 c zirounding : 0.00 0 0
1.49/1.50 c rounding : 0.00 0 0
1.49/1.50 c shifting : 0.00 0 0
1.49/1.50 c intshifting : 0.00 0 0
1.49/1.50 c oneopt : 0.00 0 0
1.49/1.50 c twoopt : 0.00 0 0
1.49/1.50 c fixandinfer : 0.00 0 0
1.49/1.50 c feaspump : 0.00 0 0
1.49/1.50 c coefdiving : 0.00 0 0
1.49/1.50 c pscostdiving : 0.00 0 0
1.49/1.50 c fracdiving : 0.00 0 0
1.49/1.50 c veclendiving : 0.00 0 0
1.49/1.50 c intdiving : 0.00 0 0
1.49/1.50 c actconsdiving : 0.00 0 0
1.49/1.50 c objpscostdiving : 0.00 0 0
1.49/1.50 c rootsoldiving : 0.00 0 0
1.49/1.50 c linesearchdiving : 0.00 0 0
1.49/1.50 c guideddiving : 0.00 0 0
1.49/1.50 c octane : 0.00 0 0
1.49/1.50 c rens : 0.00 0 0
1.49/1.50 c rins : 0.00 0 0
1.49/1.50 c localbranching : 0.00 0 0
1.49/1.50 c mutation : 0.00 0 0
1.49/1.50 c crossover : 0.00 0 0
1.49/1.50 c dins : 0.00 0 0
1.49/1.50 c undercover : 0.00 0 0
1.49/1.50 c nlp : 0.00 0 0
1.49/1.50 c trysol : 0.00 0 0
1.49/1.50 c LP : Time Calls Iterations Iter/call Iter/sec
1.49/1.50 c primal LP : 0.00 0 0 0.00 -
1.49/1.50 c dual LP : 0.00 0 0 0.00 -
1.49/1.50 c lex dual LP : 0.00 0 0 0.00 -
1.49/1.50 c barrier LP : 0.00 0 0 0.00 -
1.49/1.50 c diving/probing LP: 0.00 0 0 0.00 -
1.49/1.50 c strong branching : 0.00 0 0 0.00 -
1.49/1.50 c (at root node) : - 0 0 0.00 -
1.49/1.50 c conflict analysis: 0.00 0 0 0.00 -
1.49/1.50 c B&B Tree :
1.49/1.50 c number of runs : 1
1.49/1.50 c nodes : 1687
1.49/1.50 c nodes (total) : 1687
1.49/1.50 c nodes left : 0
1.49/1.50 c max depth : 106
1.49/1.50 c max depth (total): 106
1.49/1.50 c backtracks : 232 (13.8%)
1.49/1.50 c delayed cutoffs : 1146
1.49/1.50 c repropagations : 1367 (6643 domain reductions, 182 cutoffs)
1.49/1.50 c avg switch length: 3.89
1.49/1.50 c switching time : 0.16
1.49/1.50 c Solution :
1.49/1.50 c Solutions found : 0 (0 improvements)
1.49/1.50 c Primal Bound : infeasible
1.49/1.50 c Dual Bound : -
1.49/1.50 c Gap : 0.00 %
1.49/1.50 c Root Dual Bound : +0.00000000000000e+00
1.49/1.50 c Root Iterations : 0
1.49/1.52 c Time complete: 1.51.