0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: 947bdb7-dirty]
0.00/0.00 c Copyright (c) 2002-2012 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-3691676-1338029037.opb>
0.00/0.03 c original problem has 3939 variables (3939 bin, 0 int, 0 impl, 0 cont) and 10412 constraints
0.00/0.03 c problem read in 0.03
0.00/0.03 c No objective function, only one solution is needed.
0.00/0.03 c presolving settings loaded
0.04/0.05 c presolving:
0.09/0.13 c (round 1) 520 del vars, 652 del conss, 0 add conss, 221 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170882 impls, 0 clqs
0.09/0.14 c (round 2) 522 del vars, 1334 del conss, 0 add conss, 223 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170882 impls, 0 clqs
0.09/0.15 c (round 3) 542 del vars, 1384 del conss, 0 add conss, 243 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170954 impls, 0 clqs
0.09/0.15 c (round 4) 546 del vars, 1390 del conss, 0 add conss, 247 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170954 impls, 0 clqs
0.09/0.15 c (round 5) 552 del vars, 1401 del conss, 0 add conss, 253 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170968 impls, 0 clqs
0.09/0.15 c (round 6) 556 del vars, 1415 del conss, 0 add conss, 257 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 171196 impls, 0 clqs
0.09/0.16 c (round 7) 560 del vars, 1425 del conss, 0 add conss, 261 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 171224 impls, 0 clqs
0.09/0.16 c (round 8) 560 del vars, 1433 del conss, 0 add conss, 261 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 171264 impls, 0 clqs
0.19/0.21 c (round 9) 560 del vars, 1439 del conss, 0 add conss, 261 chg bounds, 336 chg sides, 724 chg coeffs, 8977 upgd conss, 171264 impls, 0 clqs
0.19/0.25 c (round 10) 560 del vars, 9675 del conss, 2744 add conss, 261 chg bounds, 336 chg sides, 724 chg coeffs, 8977 upgd conss, 171264 impls, 0 clqs
0.19/0.26 c (round 11) 638 del vars, 10001 del conss, 3070 add conss, 261 chg bounds, 336 chg sides, 724 chg coeffs, 8977 upgd conss, 173945 impls, 3 clqs
0.19/0.27 c (round 12) 652 del vars, 10006 del conss, 3070 add conss, 261 chg bounds, 336 chg sides, 725 chg coeffs, 8979 upgd conss, 174579 impls, 326 clqs
0.19/0.27 c (round 13) 657 del vars, 10010 del conss, 3070 add conss, 261 chg bounds, 336 chg sides, 727 chg coeffs, 8979 upgd conss, 175605 impls, 327 clqs
0.19/0.28 c (round 14) 658 del vars, 10013 del conss, 3070 add conss, 261 chg bounds, 336 chg sides, 727 chg coeffs, 8979 upgd conss, 175605 impls, 327 clqs
0.19/0.28 c (round 15) 659 del vars, 10013 del conss, 3070 add conss, 261 chg bounds, 336 chg sides, 727 chg coeffs, 8979 upgd conss, 175605 impls, 327 clqs
0.19/0.28 c (round 16) 660 del vars, 10013 del conss, 3070 add conss, 261 chg bounds, 336 chg sides, 727 chg coeffs, 8979 upgd conss, 175605 impls, 327 clqs
0.19/0.28 c (round 17) 661 del vars, 10013 del conss, 3070 add conss, 261 chg bounds, 336 chg sides, 727 chg coeffs, 8979 upgd conss, 175605 impls, 327 clqs
0.19/0.29 c (round 18) 662 del vars, 10014 del conss, 3070 add conss, 261 chg bounds, 336 chg sides, 728 chg coeffs, 8979 upgd conss, 175605 impls, 327 clqs
0.19/0.29 c (round 19) 676 del vars, 10102 del conss, 3158 add conss, 261 chg bounds, 336 chg sides, 728 chg coeffs, 8979 upgd conss, 176805 impls, 327 clqs
0.29/0.30 c (round 20) 682 del vars, 10132 del conss, 3172 add conss, 261 chg bounds, 336 chg sides, 728 chg coeffs, 8979 upgd conss, 177209 impls, 337 clqs
0.29/0.31 c (round 21) 684 del vars, 10141 del conss, 3178 add conss, 261 chg bounds, 336 chg sides, 728 chg coeffs, 8979 upgd conss, 177691 impls, 337 clqs
0.29/0.36 c (round 22) 694 del vars, 10155 del conss, 3180 add conss, 261 chg bounds, 336 chg sides, 728 chg coeffs, 8979 upgd conss, 178069 impls, 337 clqs
0.39/0.40 c (round 23) 695 del vars, 10156 del conss, 3180 add conss, 261 chg bounds, 336 chg sides, 728 chg coeffs, 8979 upgd conss, 178079 impls, 337 clqs
0.39/0.44 c (round 24) 696 del vars, 10158 del conss, 3180 add conss, 261 chg bounds, 336 chg sides, 728 chg coeffs, 8979 upgd conss, 178663 impls, 337 clqs
0.39/0.45 c (round 25) 699 del vars, 10158 del conss, 3180 add conss, 261 chg bounds, 336 chg sides, 728 chg coeffs, 8979 upgd conss, 178697 impls, 337 clqs
0.49/0.50 c (round 26) 699 del vars, 10161 del conss, 3183 add conss, 261 chg bounds, 336 chg sides, 728 chg coeffs, 8979 upgd conss, 178697 impls, 337 clqs
0.49/0.55 c (round 27) 699 del vars, 10163 del conss, 3183 add conss, 261 chg bounds, 336 chg sides, 728 chg coeffs, 8979 upgd conss, 178697 impls, 337 clqs
0.59/0.60 c presolving (28 rounds):
0.59/0.60 c 699 deleted vars, 10163 deleted constraints, 3183 added constraints, 261 tightened bounds, 0 added holes, 336 changed sides, 728 changed coefficients
0.59/0.60 c 178697 implications, 337 cliques
0.59/0.60 c presolved problem has 3240 variables (3240 bin, 0 int, 0 impl, 0 cont) and 3417 constraints
0.59/0.60 c 672 constraints of type <knapsack>
0.59/0.60 c 473 constraints of type <setppc>
0.59/0.60 c 2268 constraints of type <and>
0.59/0.60 c 4 constraints of type <logicor>
0.59/0.60 c transformed objective value is always integral (scale: 1)
0.59/0.60 c Presolving Time: 0.55
0.59/0.60 c - non default parameters ----------------------------------------------------------------------
0.59/0.60 c # SCIP version 2.1.1.4
0.59/0.60 c
0.59/0.60 c # maximal time in seconds to run
0.59/0.60 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.59/0.60 c limits/time = 1797
0.59/0.60 c
0.59/0.60 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.59/0.60 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.59/0.60 c limits/memory = 13950
0.59/0.60 c
0.59/0.60 c # solving stops, if the given number of solutions were found (-1: no limit)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.60 c limits/solutions = 1
0.59/0.60 c
0.59/0.60 c # maximal number of separation rounds per node (-1: unlimited)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: 5]
0.59/0.60 c separating/maxrounds = 1
0.59/0.60 c
0.59/0.60 c # maximal number of separation rounds in the root node (-1: unlimited)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.60 c separating/maxroundsroot = 5
0.59/0.60 c
0.59/0.60 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.59/0.60 c # [type: int, range: [1,2], default: 1]
0.59/0.60 c timing/clocktype = 2
0.59/0.60 c
0.59/0.60 c # belongs reading time to solving time?
0.59/0.60 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.60 c timing/reading = TRUE
0.59/0.60 c
0.59/0.60 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.59/0.60 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.59/0.60 c constraints/knapsack/disaggregation = FALSE
0.59/0.60 c
0.59/0.60 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.60 c heuristics/coefdiving/freq = -1
0.59/0.60 c
0.59/0.60 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.60 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.60 c heuristics/coefdiving/maxlpiterquot = 0.075
0.59/0.60 c
0.59/0.60 c # additional number of allowed LP iterations
0.59/0.60 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.60 c heuristics/coefdiving/maxlpiterofs = 1500
0.59/0.60 c
0.59/0.60 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: 30]
0.59/0.60 c heuristics/crossover/freq = -1
0.59/0.60 c
0.59/0.60 c # number of nodes added to the contingent of the total nodes
0.59/0.60 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.59/0.60 c heuristics/crossover/nodesofs = 750
0.59/0.60 c
0.59/0.60 c # number of nodes without incumbent change that heuristic should wait
0.59/0.60 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.59/0.60 c heuristics/crossover/nwaitingnodes = 100
0.59/0.60 c
0.59/0.60 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.59/0.60 c # [type: real, range: [0,1], default: 0.1]
0.59/0.60 c heuristics/crossover/nodesquot = 0.15
0.59/0.60 c
0.59/0.60 c # minimum percentage of integer variables that have to be fixed
0.59/0.60 c # [type: real, range: [0,1], default: 0.666]
0.59/0.60 c heuristics/crossover/minfixingrate = 0.5
0.59/0.60 c
0.59/0.60 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.60 c heuristics/feaspump/freq = -1
0.59/0.60 c
0.59/0.60 c # additional number of allowed LP iterations
0.59/0.60 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.60 c heuristics/feaspump/maxlpiterofs = 2000
0.59/0.60 c
0.59/0.60 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.60 c heuristics/fracdiving/freq = -1
0.59/0.60 c
0.59/0.60 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.60 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.60 c heuristics/fracdiving/maxlpiterquot = 0.075
0.59/0.60 c
0.59/0.60 c # additional number of allowed LP iterations
0.59/0.60 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.60 c heuristics/fracdiving/maxlpiterofs = 1500
0.59/0.60 c
0.59/0.60 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.60 c heuristics/guideddiving/freq = -1
0.59/0.60 c
0.59/0.60 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.60 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.60 c heuristics/guideddiving/maxlpiterquot = 0.075
0.59/0.60 c
0.59/0.60 c # additional number of allowed LP iterations
0.59/0.60 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.60 c heuristics/guideddiving/maxlpiterofs = 1500
0.59/0.60 c
0.59/0.60 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.60 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.60 c heuristics/intdiving/maxlpiterquot = 0.075
0.59/0.60 c
0.59/0.60 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.60 c heuristics/intshifting/freq = -1
0.59/0.60 c
0.59/0.60 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.60 c heuristics/linesearchdiving/freq = -1
0.59/0.60 c
0.59/0.60 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.60 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.60 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.59/0.60 c
0.59/0.60 c # additional number of allowed LP iterations
0.59/0.60 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.60 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.59/0.60 c
0.59/0.60 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.60 c heuristics/objpscostdiving/freq = -1
0.59/0.60 c
0.59/0.60 c # maximal fraction of diving LP iterations compared to total iteration number
0.59/0.60 c # [type: real, range: [0,1], default: 0.01]
0.59/0.60 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.59/0.60 c
0.59/0.60 c # additional number of allowed LP iterations
0.59/0.60 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.60 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.59/0.60 c
0.59/0.60 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.60 c heuristics/oneopt/freq = -1
0.59/0.60 c
0.59/0.60 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.60 c heuristics/pscostdiving/freq = -1
0.59/0.60 c
0.59/0.60 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.60 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.60 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.59/0.60 c
0.59/0.60 c # additional number of allowed LP iterations
0.59/0.60 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.60 c heuristics/pscostdiving/maxlpiterofs = 1500
0.59/0.60 c
0.59/0.60 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.60 c heuristics/rens/freq = -1
0.59/0.60 c
0.59/0.60 c # minimum percentage of integer variables that have to be fixable
0.59/0.60 c # [type: real, range: [0,1], default: 0.5]
0.59/0.60 c heuristics/rens/minfixingrate = 0.3
0.59/0.60 c
0.59/0.60 c # number of nodes added to the contingent of the total nodes
0.59/0.60 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.59/0.60 c heuristics/rens/nodesofs = 2000
0.59/0.60 c
0.59/0.60 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.60 c heuristics/rootsoldiving/freq = -1
0.59/0.60 c
0.59/0.60 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.60 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.59/0.60 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.59/0.60 c
0.59/0.60 c # additional number of allowed LP iterations
0.59/0.60 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.60 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.59/0.60 c
0.59/0.60 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.60 c heuristics/rounding/freq = -1
0.59/0.60 c
0.59/0.60 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.60 c heuristics/shiftandpropagate/freq = -1
0.59/0.60 c
0.59/0.60 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.60 c heuristics/shifting/freq = -1
0.59/0.60 c
0.59/0.60 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.60 c heuristics/simplerounding/freq = -1
0.59/0.60 c
0.59/0.60 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.60 c heuristics/subnlp/freq = -1
0.59/0.60 c
0.59/0.60 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.60 c heuristics/trivial/freq = -1
0.59/0.60 c
0.59/0.60 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.60 c heuristics/trysol/freq = -1
0.59/0.60 c
0.59/0.60 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.60 c heuristics/undercover/freq = -1
0.59/0.60 c
0.59/0.60 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.60 c heuristics/veclendiving/freq = -1
0.59/0.60 c
0.59/0.60 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.60 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.60 c heuristics/veclendiving/maxlpiterquot = 0.075
0.59/0.60 c
0.59/0.60 c # additional number of allowed LP iterations
0.59/0.60 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.60 c heuristics/veclendiving/maxlpiterofs = 1500
0.59/0.60 c
0.59/0.60 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.60 c heuristics/zirounding/freq = -1
0.59/0.60 c
0.59/0.60 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.60 c propagating/probing/maxprerounds = 0
0.59/0.60 c
0.59/0.60 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.60 c separating/cmir/freq = -1
0.59/0.60 c
0.59/0.60 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.60 c separating/flowcover/freq = -1
0.59/0.60 c
0.59/0.60 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.60 c separating/rapidlearning/freq = 0
0.59/0.60 c
0.59/0.60 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
0.59/0.60 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.60 c heuristics/indoneopt/freq = -1
0.59/0.60 c
0.59/0.60 c -----------------------------------------------------------------------------------------------
0.59/0.60 c start solving
0.59/0.60 c
0.59/0.65 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.59/0.65 c 0.7s| 1 | 0 | 595 | - | 27M| 0 | 473 |3240 |3417 |3240 |5685 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1.10/1.16 c 1.2s| 1 | 0 | 1449 | - | 27M| 0 | 785 |3240 |3599 |3240 |5938 | 323 | 0 | 0 | 0.000000e+00 | -- | Inf
1.29/1.39 c 1.4s| 1 | 0 | 2878 | - | 28M| 0 |1052 |3240 |3599 |3240 |6681 |1066 | 0 | 0 | 0.000000e+00 | -- | Inf
2.10/2.20 c 2.2s| 1 | 0 | 6374 | - | 28M| 0 |1500 |3240 |3599 |3240 |7399 |1784 | 0 | 0 | 0.000000e+00 | -- | Inf
3.09/3.10 c 3.1s| 1 | 0 | 9245 | - | 29M| 0 |1481 |3240 |3599 |3240 |8607 |2992 | 0 | 0 | 0.000000e+00 | -- | Inf
3.59/3.60 c 3.6s| 1 | 0 | 11038 | - | 30M| 0 |1492 |3240 |3599 |3240 |9483 |3868 | 0 | 0 | 0.000000e+00 | -- | Inf
4.88/4.98 c 5.0s| 1 | 2 | 11038 | - | 30M| 0 |1492 |3240 |3599 |3240 |9483 |3868 | 0 | 10 | 0.000000e+00 | -- | Inf
33.67/33.77 c 33.8s| 100 | 60 | 27714 | 168.4 | 31M| 25 | - |3240 |3662 | 0 | 0 |5436 | 63 | 745 | 0.000000e+00 | -- | Inf
39.97/40.09 c 40.1s| 200 | 90 | 46170 | 176.5 | 32M| 26 | 903 |3240 |3783 |3240 |7489 |7141 | 184 | 790 | 0.000000e+00 | -- | Inf
45.77/45.83 c 45.8s| 300 | 62 | 64390 | 178.4 | 32M| 26 | - |3240 |3921 | 0 | 0 |8497 | 322 | 835 | 0.000000e+00 | -- | Inf
51.26/51.33 c 51.3s| 400 | 68 | 80945 | 175.2 | 32M| 26 | 821 |3240 |4036 |3240 |7510 |9567 | 437 | 894 | 0.000000e+00 | -- | Inf
57.66/57.73 c 57.7s| 500 | 61 | 98366 | 175.0 | 32M| 26 | 833 |3240 |4149 |3240 |7500 | 10k| 550 | 959 | 0.000000e+00 | -- | Inf
64.26/64.35 c 64.3s| 600 | 67 |119076 | 180.4 | 32M| 26 | 994 |3240 |4257 |3240 |7617 | 12k| 662 |1015 | 0.000000e+00 | -- | Inf
70.37/70.49 c 70.5s| 700 | 58 |137254 | 180.6 | 32M| 26 | - |3240 |4412 | 0 | 0 | 13k| 824 |1069 | 0.000000e+00 | -- | Inf
77.26/77.32 c 77.3s| 800 | 31 |153925 | 178.8 | 32M| 26 | 955 |3240 |4490 |3240 |7360 | 15k| 959 |1177 | 0.000000e+00 | -- | Inf
84.87/84.95 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
84.87/84.95 c 84.9s| 900 | 16 |174155 | 181.4 | 32M| 26 |1319 |3240 |4541 |3240 |7082 | 16k|1096 |1222 | 0.000000e+00 | -- | Inf
94.76/94.89 c 94.9s| 1000 | 18 |202404 | 191.6 | 32M| 26 | 977 |3240 |4619 |3240 |7305 | 19k|1242 |1316 | 0.000000e+00 | -- | Inf
105.16/105.22 c 105s| 1100 | 4 |232254 | 201.3 | 30M| 26 |1060 |3240 |4016 |3240 |7358 | 23k|1388 |1410 | 0.000000e+00 | -- | Inf
105.26/105.39 c
105.26/105.39 c SCIP Status : problem is solved [infeasible]
105.26/105.39 c Solving Time (sec) : 105.39
105.26/105.39 c Solving Nodes : 1104
105.26/105.39 c Primal Bound : +1.00000000000000e+20 (0 solutions)
105.26/105.39 c Dual Bound : +1.00000000000000e+20
105.26/105.39 c Gap : 0.00 %
105.26/105.39 s UNSATISFIABLE
105.26/105.39 c SCIP Status : problem is solved [infeasible]
105.26/105.39 c Total Time : 105.39
105.26/105.39 c solving : 105.39
105.26/105.39 c presolving : 0.55 (included in solving)
105.26/105.39 c reading : 0.03 (included in solving)
105.26/105.39 c copying : 0.01 (1 #copies) (minimal 0.01, maximal 0.01, average 0.01)
105.26/105.39 c Original Problem :
105.26/105.39 c Problem name : HOME/instance-3691676-1338029037.opb
105.26/105.39 c Variables : 3939 (3939 binary, 0 integer, 0 implicit integer, 0 continuous)
105.26/105.39 c Constraints : 10412 initial, 10412 maximal
105.26/105.39 c Objective sense : minimize
105.26/105.39 c Presolved Problem :
105.26/105.39 c Problem name : t_HOME/instance-3691676-1338029037.opb
105.26/105.39 c Variables : 3240 (3240 binary, 0 integer, 0 implicit integer, 0 continuous)
105.26/105.39 c Constraints : 3417 initial, 4684 maximal
105.26/105.39 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
105.26/105.39 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
105.26/105.39 c trivial : 0.00 0.00 5 0 0 0 0 0 0 0 0
105.26/105.39 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
105.26/105.39 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
105.26/105.39 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
105.26/105.39 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
105.26/105.39 c gateextraction : 0.02 0.00 0 0 0 0 0 8236 2744 0 0
105.26/105.39 c implics : 0.02 0.00 0 294 0 0 0 0 0 0 0
105.26/105.39 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
105.26/105.39 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
105.26/105.39 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
105.26/105.39 c knapsack : 0.01 0.00 0 0 0 0 0 0 0 0 0
105.26/105.39 c setppc : 0.02 0.00 0 3 0 0 0 33 0 0 0
105.26/105.39 c and : 0.31 0.00 12 119 0 0 0 455 439 0 4
105.26/105.39 c linear : 0.12 0.00 261 5 0 261 0 1439 0 336 724
105.26/105.39 c logicor : 0.02 0.00 0 0 0 0 0 0 0 0 0
105.26/105.39 c root node : - - 468 - - 468 - - - - -
105.26/105.39 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
105.26/105.39 c integral : 0 0 0 0 857 0 1 0 10 181 0 0 1564
105.26/105.39 c knapsack : 672 672 6 12639 0 0 0 216 0 852 1201 0 0
105.26/105.39 c setppc : 473 473 6 12639 0 0 0 15364 73 17954 0 0 0
105.26/105.39 c and : 2268 2268 803 12566 0 0 0 125435 320 98850 23212 0 0
105.26/105.39 c linear : 0+ 221 5 12245 0 0 0 1455 42 1180 19 0 0
105.26/105.39 c logicor : 4+ 1089 6 5542 0 0 0 4075 128 3713 0 0 0
105.26/105.39 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0
105.26/105.39 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
105.26/105.39 c integral : 52.11 0.00 0.00 0.00 52.11 0.00 0.00 0.00
105.26/105.39 c knapsack : 0.16 0.00 0.02 0.14 0.00 0.00 0.00 0.00
105.26/105.39 c setppc : 0.11 0.00 0.00 0.10 0.00 0.00 0.00 0.01
105.26/105.39 c and : 0.77 0.00 0.27 0.45 0.00 0.00 0.00 0.06
105.26/105.39 c linear : 0.05 0.00 0.00 0.05 0.00 0.00 0.00 0.00
105.26/105.39 c logicor : 0.10 0.00 0.00 0.09 0.00 0.00 0.00 0.01
105.26/105.39 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
105.26/105.39 c Propagators : #Propagate #ResProp Cutoffs DomReds
105.26/105.39 c rootredcost : 0 0 0 0
105.26/105.39 c pseudoobj : 0 0 0 0
105.26/105.39 c vbounds : 0 0 0 0
105.26/105.39 c redcost : 1620 0 0 0
105.26/105.39 c probing : 0 0 0 0
105.26/105.39 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
105.26/105.39 c rootredcost : 0.00 0.00 0.00 0.00 0.00
105.26/105.39 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
105.26/105.39 c vbounds : 0.00 0.00 0.00 0.00 0.00
105.26/105.39 c redcost : 0.07 0.00 0.00 0.07 0.00
105.26/105.39 c probing : 0.00 0.00 0.00 0.00 0.00
105.26/105.39 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
105.26/105.39 c propagation : 0.14 563 547 3411 47.6 113 22.0 -
105.26/105.39 c infeasible LP : 0.00 5 5 7 5.0 0 0.0 0
105.26/105.39 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
105.26/105.39 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
105.26/105.39 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
105.26/105.39 c applied globally : - - - 1397 29.6 - - -
105.26/105.39 c applied locally : - - - 0 0.0 - - -
105.26/105.39 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
105.26/105.39 c cut pool : 0.00 4 - - 125 - (maximal pool size: 4359)
105.26/105.39 c closecuts : 0.00 0.00 0 0 0 0 0
105.26/105.39 c impliedbounds : 0.01 0.00 5 0 0 5480 0
105.26/105.39 c intobj : 0.00 0.00 0 0 0 0 0
105.26/105.39 c gomory : 0.04 0.00 5 0 0 250 0
105.26/105.39 c cgmip : 0.00 0.00 0 0 0 0 0
105.26/105.39 c strongcg : 0.79 0.00 5 0 0 2149 0
105.26/105.39 c cmir : 0.00 0.00 0 0 0 0 0
105.26/105.39 c flowcover : 0.00 0.00 0 0 0 0 0
105.26/105.39 c clique : 0.14 0.00 5 0 0 40 0
105.26/105.39 c zerohalf : 0.00 0.00 0 0 0 0 0
105.26/105.39 c mcf : 0.00 0.00 1 0 0 0 0
105.26/105.39 c oddcycle : 0.00 0.00 0 0 0 0 0
105.26/105.39 c rapidlearning : 0.33 0.00 1 0 14 0 221
105.26/105.39 c Pricers : ExecTime SetupTime Calls Vars
105.26/105.39 c problem variables: 0.00 - 0 0
105.26/105.39 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
105.26/105.39 c relpscost : 52.11 0.00 857 10 181 0 0 1564
105.26/105.39 c pscost : 0.00 0.00 0 0 0 0 0 0
105.26/105.39 c inference : 0.00 0.00 0 0 0 0 0 0
105.26/105.39 c mostinf : 0.00 0.00 0 0 0 0 0 0
105.26/105.39 c leastinf : 0.00 0.00 0 0 0 0 0 0
105.26/105.39 c fullstrong : 0.00 0.00 0 0 0 0 0 0
105.26/105.39 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
105.26/105.39 c random : 0.00 0.00 0 0 0 0 0 0
105.26/105.39 c Primal Heuristics : ExecTime SetupTime Calls Found
105.26/105.39 c LP solutions : 0.00 - - 0
105.26/105.39 c pseudo solutions : 0.00 - - 0
105.26/105.39 c smallcard : 0.00 0.00 0 0
105.26/105.39 c trivial : 0.00 0.00 1 0
105.26/105.39 c shiftandpropagate: 0.00 0.00 0 0
105.26/105.39 c simplerounding : 0.00 0.00 0 0
105.26/105.39 c zirounding : 0.00 0.00 0 0
105.26/105.39 c rounding : 0.00 0.00 0 0
105.26/105.39 c shifting : 0.00 0.00 0 0
105.26/105.39 c intshifting : 0.00 0.00 0 0
105.26/105.39 c oneopt : 0.00 0.00 0 0
105.26/105.39 c twoopt : 0.00 0.00 0 0
105.26/105.39 c indtwoopt : 0.00 0.00 0 0
105.26/105.39 c indoneopt : 0.00 0.00 0 0
105.26/105.39 c fixandinfer : 0.00 0.00 0 0
105.26/105.39 c feaspump : 0.00 0.00 0 0
105.26/105.39 c clique : 0.00 0.00 0 0
105.26/105.39 c indrounding : 0.00 0.00 0 0
105.26/105.39 c indcoefdiving : 0.00 0.00 0 0
105.26/105.39 c coefdiving : 0.00 0.00 0 0
105.26/105.39 c pscostdiving : 0.00 0.00 0 0
105.26/105.39 c nlpdiving : 0.00 0.00 0 0
105.26/105.39 c fracdiving : 0.00 0.00 0 0
105.26/105.39 c veclendiving : 0.00 0.00 0 0
105.26/105.39 c intdiving : 0.00 0.00 0 0
105.26/105.39 c actconsdiving : 0.00 0.00 0 0
105.26/105.39 c objpscostdiving : 0.00 0.00 0 0
105.26/105.39 c rootsoldiving : 0.00 0.00 0 0
105.26/105.39 c linesearchdiving : 0.00 0.00 0 0
105.26/105.39 c guideddiving : 0.00 0.00 0 0
105.26/105.39 c octane : 0.00 0.00 0 0
105.26/105.39 c rens : 0.00 0.00 0 0
105.26/105.39 c rins : 0.00 0.00 0 0
105.26/105.39 c localbranching : 0.00 0.00 0 0
105.26/105.39 c mutation : 0.00 0.00 0 0
105.26/105.39 c crossover : 0.00 0.00 0 0
105.26/105.39 c dins : 0.00 0.00 0 0
105.26/105.39 c vbounds : 0.00 0.00 0 0
105.26/105.39 c undercover : 0.00 0.00 0 0
105.26/105.39 c subnlp : 0.00 0.00 0 0
105.26/105.39 c trysol : 0.00 0.00 0 0
105.26/105.39 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
105.26/105.39 c primal LP : 0.00 1 0 0.00 - 0.00 1
105.26/105.39 c dual LP : 47.27 1626 232921 143.34 4927.07 0.00 1
105.26/105.39 c lex dual LP : 0.00 0 0 0.00 -
105.26/105.39 c barrier LP : 0.00 0 0 0.00 - 0.00 0
105.26/105.39 c diving/probing LP: 0.00 0 0 0.00 -
105.26/105.39 c strong branching : 51.87 1410 222386 157.72 4287.61
105.26/105.39 c (at root node) : - 10 5144 514.40 -
105.26/105.39 c conflict analysis: 0.00 0 0 0.00 -
105.26/105.39 c B&B Tree :
105.26/105.39 c number of runs : 1
105.26/105.39 c nodes : 1104
105.26/105.39 c nodes (total) : 1104
105.26/105.39 c nodes left : 0
105.26/105.39 c max depth : 26
105.26/105.39 c max depth (total): 26
105.26/105.39 c backtracks : 359 (32.5%)
105.26/105.39 c delayed cutoffs : 461
105.26/105.39 c repropagations : 893 (39743 domain reductions, 266 cutoffs)
105.26/105.39 c avg switch length: 3.92
105.26/105.39 c switching time : 0.40
105.26/105.39 c Solution :
105.26/105.39 c Solutions found : 0 (0 improvements)
105.26/105.39 c Primal Bound : infeasible
105.26/105.39 c Dual Bound : -
105.26/105.39 c Gap : 0.00 %
105.26/105.39 c Root Dual Bound : +0.00000000000000e+00
105.26/105.39 c Root Iterations : 11038
105.36/105.43 c Time complete: 105.39.