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-3690510-1338016948.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.02/0.06 c presolving:
0.09/0.15 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.16 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.16 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.16 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.16 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.17 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.17 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.17 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.22 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.26 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.28 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.28 c (round 12) 652 del vars, 10006 del conss, 3070 add conss, 261 chg bounds, 336 chg sides, 725 chg coeffs, 8981 upgd conss, 174579 impls, 326 clqs
0.19/0.29 c (round 13) 657 del vars, 10010 del conss, 3070 add conss, 261 chg bounds, 336 chg sides, 727 chg coeffs, 8981 upgd conss, 175605 impls, 327 clqs
0.19/0.29 c (round 14) 658 del vars, 10013 del conss, 3070 add conss, 261 chg bounds, 336 chg sides, 727 chg coeffs, 8981 upgd conss, 175605 impls, 327 clqs
0.19/0.29 c (round 15) 659 del vars, 10013 del conss, 3070 add conss, 261 chg bounds, 336 chg sides, 727 chg coeffs, 8981 upgd conss, 175605 impls, 327 clqs
0.19/0.30 c (round 16) 660 del vars, 10013 del conss, 3070 add conss, 261 chg bounds, 336 chg sides, 727 chg coeffs, 8981 upgd conss, 175605 impls, 327 clqs
0.29/0.30 c (round 17) 661 del vars, 10013 del conss, 3070 add conss, 261 chg bounds, 336 chg sides, 727 chg coeffs, 8981 upgd conss, 175605 impls, 327 clqs
0.29/0.30 c (round 18) 662 del vars, 10014 del conss, 3070 add conss, 261 chg bounds, 336 chg sides, 728 chg coeffs, 8981 upgd conss, 175605 impls, 327 clqs
0.29/0.31 c (round 19) 676 del vars, 10102 del conss, 3158 add conss, 261 chg bounds, 336 chg sides, 728 chg coeffs, 8981 upgd conss, 176805 impls, 327 clqs
0.29/0.32 c (round 20) 682 del vars, 10132 del conss, 3172 add conss, 261 chg bounds, 336 chg sides, 728 chg coeffs, 8981 upgd conss, 177209 impls, 337 clqs
0.29/0.32 c (round 21) 684 del vars, 10141 del conss, 3178 add conss, 261 chg bounds, 336 chg sides, 728 chg coeffs, 8981 upgd conss, 177691 impls, 337 clqs
0.29/0.37 c (round 22) 694 del vars, 10155 del conss, 3180 add conss, 261 chg bounds, 336 chg sides, 728 chg coeffs, 8981 upgd conss, 178069 impls, 337 clqs
0.39/0.42 c (round 23) 695 del vars, 10156 del conss, 3180 add conss, 261 chg bounds, 336 chg sides, 728 chg coeffs, 8981 upgd conss, 178079 impls, 337 clqs
0.39/0.46 c (round 24) 696 del vars, 10158 del conss, 3180 add conss, 261 chg bounds, 336 chg sides, 728 chg coeffs, 8981 upgd conss, 178663 impls, 337 clqs
0.39/0.46 c (round 25) 699 del vars, 10158 del conss, 3180 add conss, 261 chg bounds, 336 chg sides, 728 chg coeffs, 8981 upgd conss, 178697 impls, 337 clqs
0.49/0.51 c (round 26) 699 del vars, 10161 del conss, 3183 add conss, 261 chg bounds, 336 chg sides, 728 chg coeffs, 8981 upgd conss, 178697 impls, 337 clqs
0.49/0.56 c (round 27) 699 del vars, 10163 del conss, 3183 add conss, 261 chg bounds, 336 chg sides, 728 chg coeffs, 8981 upgd conss, 178697 impls, 337 clqs
0.59/0.61 c presolving (28 rounds):
0.59/0.61 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.61 c 178697 implications, 337 cliques
0.59/0.61 c presolved problem has 3240 variables (3240 bin, 0 int, 0 impl, 0 cont) and 3417 constraints
0.59/0.61 c 672 constraints of type <knapsack>
0.59/0.61 c 473 constraints of type <setppc>
0.59/0.61 c 2268 constraints of type <and>
0.59/0.61 c 4 constraints of type <logicor>
0.59/0.61 c transformed objective value is always integral (scale: 1)
0.59/0.61 c Presolving Time: 0.57
0.59/0.61 c - non default parameters ----------------------------------------------------------------------
0.59/0.61 c # SCIP version 2.1.1.4
0.59/0.61 c
0.59/0.61 c # maximal time in seconds to run
0.59/0.61 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.59/0.61 c limits/time = 1797
0.59/0.61 c
0.59/0.61 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.59/0.61 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.59/0.61 c limits/memory = 13950
0.59/0.61 c
0.59/0.61 c # solving stops, if the given number of solutions were found (-1: no limit)
0.59/0.61 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.61 c limits/solutions = 1
0.59/0.61 c
0.59/0.61 c # maximal number of separation rounds per node (-1: unlimited)
0.59/0.61 c # [type: int, range: [-1,2147483647], default: 5]
0.59/0.61 c separating/maxrounds = 1
0.59/0.61 c
0.59/0.61 c # maximal number of separation rounds in the root node (-1: unlimited)
0.59/0.61 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.61 c separating/maxroundsroot = 5
0.59/0.61 c
0.59/0.61 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.59/0.61 c # [type: int, range: [1,2], default: 1]
0.59/0.61 c timing/clocktype = 2
0.59/0.61 c
0.59/0.61 c # belongs reading time to solving time?
0.59/0.61 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.61 c timing/reading = TRUE
0.59/0.61 c
0.59/0.61 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.59/0.61 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.59/0.61 c constraints/knapsack/disaggregation = FALSE
0.59/0.61 c
0.59/0.61 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.59/0.61 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.61 c heuristics/coefdiving/freq = -1
0.59/0.61 c
0.59/0.61 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.61 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.61 c heuristics/coefdiving/maxlpiterquot = 0.075
0.59/0.61 c
0.59/0.61 c # additional number of allowed LP iterations
0.59/0.61 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.61 c heuristics/coefdiving/maxlpiterofs = 1500
0.59/0.61 c
0.59/0.61 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.59/0.61 c # [type: int, range: [-1,2147483647], default: 30]
0.59/0.61 c heuristics/crossover/freq = -1
0.59/0.61 c
0.59/0.61 c # number of nodes added to the contingent of the total nodes
0.59/0.61 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.59/0.61 c heuristics/crossover/nodesofs = 750
0.59/0.61 c
0.59/0.61 c # number of nodes without incumbent change that heuristic should wait
0.59/0.61 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.59/0.61 c heuristics/crossover/nwaitingnodes = 100
0.59/0.61 c
0.59/0.61 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.59/0.61 c # [type: real, range: [0,1], default: 0.1]
0.59/0.61 c heuristics/crossover/nodesquot = 0.15
0.59/0.61 c
0.59/0.61 c # minimum percentage of integer variables that have to be fixed
0.59/0.61 c # [type: real, range: [0,1], default: 0.666]
0.59/0.61 c heuristics/crossover/minfixingrate = 0.5
0.59/0.61 c
0.59/0.61 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.59/0.61 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.61 c heuristics/feaspump/freq = -1
0.59/0.61 c
0.59/0.61 c # additional number of allowed LP iterations
0.59/0.61 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.61 c heuristics/feaspump/maxlpiterofs = 2000
0.59/0.61 c
0.59/0.61 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.59/0.61 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.61 c heuristics/fracdiving/freq = -1
0.59/0.61 c
0.59/0.61 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.61 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.61 c heuristics/fracdiving/maxlpiterquot = 0.075
0.59/0.61 c
0.59/0.61 c # additional number of allowed LP iterations
0.59/0.61 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.61 c heuristics/fracdiving/maxlpiterofs = 1500
0.59/0.61 c
0.59/0.61 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.59/0.61 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.61 c heuristics/guideddiving/freq = -1
0.59/0.61 c
0.59/0.61 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.61 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.61 c heuristics/guideddiving/maxlpiterquot = 0.075
0.59/0.61 c
0.59/0.61 c # additional number of allowed LP iterations
0.59/0.61 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.61 c heuristics/guideddiving/maxlpiterofs = 1500
0.59/0.61 c
0.59/0.61 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.61 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.61 c heuristics/intdiving/maxlpiterquot = 0.075
0.59/0.61 c
0.59/0.61 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.59/0.61 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.61 c heuristics/intshifting/freq = -1
0.59/0.61 c
0.59/0.61 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.59/0.61 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.61 c heuristics/linesearchdiving/freq = -1
0.59/0.61 c
0.59/0.61 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.61 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.61 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.59/0.61 c
0.59/0.61 c # additional number of allowed LP iterations
0.59/0.61 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.61 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.59/0.61 c
0.59/0.61 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.59/0.61 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.61 c heuristics/objpscostdiving/freq = -1
0.59/0.61 c
0.59/0.61 c # maximal fraction of diving LP iterations compared to total iteration number
0.59/0.61 c # [type: real, range: [0,1], default: 0.01]
0.59/0.61 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.59/0.61 c
0.59/0.61 c # additional number of allowed LP iterations
0.59/0.61 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.61 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.59/0.61 c
0.59/0.61 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.59/0.61 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.61 c heuristics/oneopt/freq = -1
0.59/0.61 c
0.59/0.61 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.59/0.61 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.61 c heuristics/pscostdiving/freq = -1
0.59/0.61 c
0.59/0.61 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.61 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.61 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.59/0.61 c
0.59/0.61 c # additional number of allowed LP iterations
0.59/0.61 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.61 c heuristics/pscostdiving/maxlpiterofs = 1500
0.59/0.61 c
0.59/0.61 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.59/0.61 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.61 c heuristics/rens/freq = -1
0.59/0.61 c
0.59/0.61 c # minimum percentage of integer variables that have to be fixable
0.59/0.61 c # [type: real, range: [0,1], default: 0.5]
0.59/0.61 c heuristics/rens/minfixingrate = 0.3
0.59/0.61 c
0.59/0.61 c # number of nodes added to the contingent of the total nodes
0.59/0.61 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.59/0.61 c heuristics/rens/nodesofs = 2000
0.59/0.61 c
0.59/0.61 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.59/0.61 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.61 c heuristics/rootsoldiving/freq = -1
0.59/0.61 c
0.59/0.61 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.61 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.59/0.61 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.59/0.61 c
0.59/0.61 c # additional number of allowed LP iterations
0.59/0.61 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.61 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.59/0.62 c
0.59/0.62 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.62 c heuristics/rounding/freq = -1
0.59/0.62 c
0.59/0.62 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.62 c heuristics/shiftandpropagate/freq = -1
0.59/0.62 c
0.59/0.62 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.62 c heuristics/shifting/freq = -1
0.59/0.62 c
0.59/0.62 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.62 c heuristics/simplerounding/freq = -1
0.59/0.62 c
0.59/0.62 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.62 c heuristics/subnlp/freq = -1
0.59/0.62 c
0.59/0.62 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.62 c heuristics/trivial/freq = -1
0.59/0.62 c
0.59/0.62 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.62 c heuristics/trysol/freq = -1
0.59/0.62 c
0.59/0.62 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.62 c heuristics/undercover/freq = -1
0.59/0.62 c
0.59/0.62 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.62 c heuristics/veclendiving/freq = -1
0.59/0.62 c
0.59/0.62 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.62 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.62 c heuristics/veclendiving/maxlpiterquot = 0.075
0.59/0.62 c
0.59/0.62 c # additional number of allowed LP iterations
0.59/0.62 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.62 c heuristics/veclendiving/maxlpiterofs = 1500
0.59/0.62 c
0.59/0.62 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.62 c heuristics/zirounding/freq = -1
0.59/0.62 c
0.59/0.62 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.62 c propagating/probing/maxprerounds = 0
0.59/0.62 c
0.59/0.62 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.62 c separating/cmir/freq = -1
0.59/0.62 c
0.59/0.62 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.62 c separating/flowcover/freq = -1
0.59/0.62 c
0.59/0.62 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.62 c separating/rapidlearning/freq = 0
0.59/0.62 c
0.59/0.62 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.62 c heuristics/indoneopt/freq = -1
0.59/0.62 c
0.59/0.62 c -----------------------------------------------------------------------------------------------
0.59/0.62 c start solving
0.59/0.62 c
0.59/0.67 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.67 c 0.7s| 1 | 0 | 595 | - | 25M| 0 | 473 |3240 |3417 |3240 |5685 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1.09/1.13 c 1.1s| 1 | 0 | 1417 | - | 26M| 0 | 766 |3240 |3576 |3240 |5939 | 324 | 0 | 0 | 0.000000e+00 | -- | Inf
1.38/1.44 c 1.4s| 1 | 0 | 3350 | - | 26M| 0 |1125 |3240 |3576 |3240 |6684 |1069 | 0 | 0 | 0.000000e+00 | -- | Inf
1.99/2.04 c 2.0s| 1 | 0 | 5267 | - | 27M| 0 |1323 |3240 |3576 |3240 |7609 |1994 | 0 | 0 | 0.000000e+00 | -- | Inf
2.89/2.97 c 3.0s| 1 | 0 | 7951 | - | 28M| 0 |1312 |3240 |3576 |3240 |8608 |2993 | 0 | 0 | 0.000000e+00 | -- | Inf
3.59/3.63 c 3.6s| 1 | 0 | 10188 | - | 28M| 0 |1466 |3240 |3576 |3240 |9224 |3609 | 0 | 0 | 0.000000e+00 | -- | Inf
4.99/5.05 c 5.0s| 1 | 2 | 10188 | - | 28M| 0 |1466 |3240 |3576 |3240 |9224 |3609 | 0 | 11 | 0.000000e+00 | -- | Inf
35.69/35.71 c 35.7s| 100 | 66 | 25860 | 158.3 | 26M| 41 | 548 |3240 |2529 |3240 |7234 |5402 | 27 |1045 | 0.000000e+00 | -- | Inf
39.59/39.64 c 39.6s| 200 | 67 | 37439 | 136.9 | 26M| 41 | 649 |3240 |2625 |3240 |7196 |6556 | 123 |1078 | 0.000000e+00 | -- | Inf
42.48/42.58 c 42.6s| 300 | 59 | 45798 | 119.1 | 26M| 41 | 738 |3240 |2715 |3240 |7211 |7349 | 213 |1112 | 0.000000e+00 | -- | Inf
46.48/46.54 c 46.5s| 400 | 66 | 56695 | 116.6 | 27M| 41 | - |3240 |2848 | 0 | 0 |8369 | 346 |1163 | 0.000000e+00 | -- | Inf
51.08/51.13 c 51.1s| 500 | 61 | 70457 | 120.8 | 27M| 41 | - |3240 |2972 | 0 | 0 |9714 | 470 |1199 | 0.000000e+00 | -- | Inf
56.38/56.49 c 56.5s| 600 | 50 | 86204 | 126.9 | 27M| 41 | - |3240 |3103 | 0 | 0 | 11k| 601 |1261 | 0.000000e+00 | -- | Inf
61.28/61.36 c 61.4s| 700 | 50 |100744 | 129.6 | 27M| 41 | - |3240 |3198 | 0 | 0 | 12k| 696 |1314 | 0.000000e+00 | -- | Inf
65.78/65.84 c 65.8s| 800 | 60 |113641 | 129.5 | 27M| 41 | - |3240 |3306 | 0 | 0 | 14k| 804 |1376 | 0.000000e+00 | -- | Inf
70.28/70.40 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
70.28/70.40 c 70.4s| 900 | 43 |127638 | 130.6 | 27M| 41 | 856 |3240 |3417 |3240 |7231 | 15k| 915 |1411 | 0.000000e+00 | -- | Inf
74.38/74.46 c 74.5s| 1000 | 39 |139821 | 129.8 | 27M| 41 | 750 |3240 |3494 |3240 |7292 | 16k|1029 |1455 | 0.000000e+00 | -- | Inf
79.58/79.61 c 79.6s| 1100 | 27 |156064 | 132.7 | 27M| 41 | 745 |3240 |3563 |3240 |7307 | 17k|1155 |1508 | 0.000000e+00 | -- | Inf
83.58/83.67 c
83.58/83.67 c SCIP Status : problem is solved [infeasible]
83.58/83.67 c Solving Time (sec) : 83.67
83.58/83.67 c Solving Nodes : 1185
83.58/83.67 c Primal Bound : +1.00000000000000e+20 (0 solutions)
83.58/83.67 c Dual Bound : +1.00000000000000e+20
83.58/83.67 c Gap : 0.00 %
83.58/83.67 s UNSATISFIABLE
83.58/83.67 c SCIP Status : problem is solved [infeasible]
83.58/83.67 c Total Time : 83.67
83.58/83.67 c solving : 83.67
83.58/83.67 c presolving : 0.57 (included in solving)
83.58/83.67 c reading : 0.03 (included in solving)
83.58/83.67 c copying : 0.01 (1 #copies) (minimal 0.01, maximal 0.01, average 0.01)
83.58/83.67 c Original Problem :
83.58/83.67 c Problem name : HOME/instance-3690510-1338016948.opb
83.58/83.67 c Variables : 3939 (3939 binary, 0 integer, 0 implicit integer, 0 continuous)
83.58/83.67 c Constraints : 10412 initial, 10412 maximal
83.58/83.67 c Objective sense : minimize
83.58/83.67 c Presolved Problem :
83.58/83.67 c Problem name : t_HOME/instance-3690510-1338016948.opb
83.58/83.67 c Variables : 3240 (3240 binary, 0 integer, 0 implicit integer, 0 continuous)
83.58/83.67 c Constraints : 3417 initial, 3615 maximal
83.58/83.67 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
83.58/83.67 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
83.58/83.67 c trivial : 0.00 0.00 5 0 0 0 0 0 0 0 0
83.58/83.67 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
83.58/83.67 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
83.58/83.67 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
83.58/83.67 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
83.58/83.67 c gateextraction : 0.02 0.00 0 0 0 0 0 8236 2744 0 0
83.58/83.67 c implics : 0.02 0.00 0 294 0 0 0 0 0 0 0
83.58/83.67 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
83.58/83.67 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
83.58/83.67 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
83.58/83.67 c knapsack : 0.01 0.00 0 0 0 0 0 0 0 0 0
83.58/83.67 c setppc : 0.02 0.00 0 3 0 0 0 33 0 0 0
83.58/83.67 c and : 0.32 0.00 12 119 0 0 0 455 439 0 4
83.58/83.67 c linear : 0.12 0.00 261 5 0 261 0 1439 0 336 724
83.58/83.67 c logicor : 0.02 0.00 0 0 0 0 0 0 0 0 0
83.58/83.67 c root node : - - 1590 - - 1590 - - - - -
83.58/83.67 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
83.58/83.67 c integral : 0 0 0 0 877 0 1 0 7 129 0 0 1638
83.58/83.67 c knapsack : 672 672 6 13049 0 0 0 76 7 1021 1202 0 0
83.58/83.67 c setppc : 473 473 6 13042 0 0 0 10247 74 16405 0 0 0
83.58/83.67 c and : 2268 2268 845 12968 0 0 0 45669 360 86176 17051 0 0
83.58/83.67 c linear : 0+ 198 5 12607 0 0 0 432 17 540 12 0 0
83.58/83.67 c logicor : 4+ 1105 6 5714 0 0 0 5339 148 4181 0 0 0
83.58/83.67 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0
83.58/83.67 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
83.58/83.67 c integral : 44.82 0.00 0.00 0.00 44.82 0.00 0.00 0.00
83.58/83.67 c knapsack : 0.17 0.00 0.01 0.16 0.00 0.00 0.00 0.00
83.58/83.67 c setppc : 0.10 0.00 0.00 0.10 0.00 0.00 0.00 0.01
83.58/83.67 c and : 0.72 0.00 0.29 0.40 0.00 0.00 0.00 0.02
83.58/83.67 c linear : 0.03 0.00 0.00 0.03 0.00 0.00 0.00 0.00
83.58/83.67 c logicor : 0.08 0.00 0.00 0.07 0.00 0.00 0.00 0.01
83.58/83.67 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
83.58/83.67 c Propagators : #Propagate #ResProp Cutoffs DomReds
83.58/83.67 c rootredcost : 0 0 0 0
83.58/83.67 c pseudoobj : 0 0 0 0
83.58/83.67 c vbounds : 0 0 0 0
83.58/83.67 c redcost : 1663 0 0 0
83.58/83.67 c probing : 0 0 0 0
83.58/83.67 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
83.58/83.67 c rootredcost : 0.00 0.00 0.00 0.00 0.00
83.58/83.67 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
83.58/83.67 c vbounds : 0.00 0.00 0.00 0.00 0.00
83.58/83.67 c redcost : 0.08 0.00 0.00 0.08 0.00
83.58/83.67 c probing : 0.00 0.00 0.00 0.00 0.00
83.58/83.67 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
83.58/83.67 c propagation : 0.06 605 602 2506 12.1 68 7.1 -
83.58/83.67 c infeasible LP : 0.01 12 12 50 13.2 3 5.3 0
83.58/83.67 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
83.58/83.67 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
83.58/83.67 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
83.58/83.67 c applied globally : - - - 1256 9.5 - - -
83.58/83.67 c applied locally : - - - 0 0.0 - - -
83.58/83.67 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
83.58/83.67 c cut pool : 0.00 4 - - 124 - (maximal pool size: 4176)
83.58/83.67 c closecuts : 0.00 0.00 0 0 0 0 0
83.58/83.67 c impliedbounds : 0.01 0.00 5 0 0 5093 0
83.58/83.67 c intobj : 0.00 0.00 0 0 0 0 0
83.58/83.67 c gomory : 0.04 0.00 5 0 0 250 0
83.58/83.67 c cgmip : 0.00 0.00 0 0 0 0 0
83.58/83.67 c strongcg : 0.89 0.00 5 0 0 2327 0
83.58/83.67 c cmir : 0.00 0.00 0 0 0 0 0
83.58/83.67 c flowcover : 0.00 0.00 0 0 0 0 0
83.58/83.67 c clique : 0.13 0.00 5 0 0 40 0
83.58/83.67 c zerohalf : 0.00 0.00 0 0 0 0 0
83.58/83.67 c mcf : 0.00 0.00 1 0 0 0 0
83.58/83.67 c oddcycle : 0.00 0.00 0 0 0 0 0
83.58/83.67 c rapidlearning : 0.30 0.00 1 0 14 0 198
83.58/83.67 c Pricers : ExecTime SetupTime Calls Vars
83.58/83.67 c problem variables: 0.00 - 0 0
83.58/83.67 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
83.58/83.67 c relpscost : 44.82 0.00 877 7 129 0 0 1638
83.58/83.67 c pscost : 0.00 0.00 0 0 0 0 0 0
83.58/83.67 c inference : 0.00 0.00 0 0 0 0 0 0
83.58/83.67 c mostinf : 0.00 0.00 0 0 0 0 0 0
83.58/83.67 c leastinf : 0.00 0.00 0 0 0 0 0 0
83.58/83.67 c fullstrong : 0.00 0.00 0 0 0 0 0 0
83.58/83.67 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
83.58/83.67 c random : 0.00 0.00 0 0 0 0 0 0
83.58/83.67 c Primal Heuristics : ExecTime SetupTime Calls Found
83.58/83.67 c LP solutions : 0.00 - - 0
83.58/83.67 c pseudo solutions : 0.00 - - 0
83.58/83.67 c smallcard : 0.00 0.00 0 0
83.58/83.67 c trivial : 0.00 0.00 1 0
83.58/83.67 c shiftandpropagate: 0.00 0.00 0 0
83.58/83.67 c simplerounding : 0.00 0.00 0 0
83.58/83.67 c zirounding : 0.00 0.00 0 0
83.58/83.67 c rounding : 0.00 0.00 0 0
83.58/83.67 c shifting : 0.00 0.00 0 0
83.58/83.67 c intshifting : 0.00 0.00 0 0
83.58/83.67 c oneopt : 0.00 0.00 0 0
83.58/83.67 c twoopt : 0.00 0.00 0 0
83.58/83.67 c indtwoopt : 0.00 0.00 0 0
83.58/83.67 c indoneopt : 0.00 0.00 0 0
83.58/83.67 c fixandinfer : 0.00 0.00 0 0
83.58/83.67 c feaspump : 0.00 0.00 0 0
83.58/83.67 c clique : 0.00 0.00 0 0
83.58/83.67 c indrounding : 0.00 0.00 0 0
83.58/83.67 c indcoefdiving : 0.00 0.00 0 0
83.58/83.67 c coefdiving : 0.00 0.00 0 0
83.58/83.67 c pscostdiving : 0.00 0.00 0 0
83.58/83.67 c nlpdiving : 0.00 0.00 0 0
83.58/83.67 c fracdiving : 0.00 0.00 0 0
83.58/83.67 c veclendiving : 0.00 0.00 0 0
83.58/83.67 c intdiving : 0.00 0.00 0 0
83.58/83.67 c actconsdiving : 0.00 0.00 0 0
83.58/83.67 c objpscostdiving : 0.00 0.00 0 0
83.58/83.67 c rootsoldiving : 0.00 0.00 0 0
83.58/83.67 c linesearchdiving : 0.00 0.00 0 0
83.58/83.67 c guideddiving : 0.00 0.00 0 0
83.58/83.67 c octane : 0.00 0.00 0 0
83.58/83.67 c rens : 0.00 0.00 0 0
83.58/83.67 c rins : 0.00 0.00 0 0
83.58/83.67 c localbranching : 0.00 0.00 0 0
83.58/83.67 c mutation : 0.00 0.00 0 0
83.58/83.67 c crossover : 0.00 0.00 0 0
83.58/83.67 c dins : 0.00 0.00 0 0
83.58/83.67 c vbounds : 0.00 0.00 0 0
83.58/83.67 c undercover : 0.00 0.00 0 0
83.58/83.67 c subnlp : 0.00 0.00 0 0
83.58/83.67 c trysol : 0.00 0.00 0 0
83.58/83.67 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
83.58/83.67 c primal LP : 0.00 1 0 0.00 - 0.00 1
83.58/83.67 c dual LP : 32.85 1676 168006 100.30 5114.40 0.00 1
83.58/83.67 c lex dual LP : 0.00 0 0 0.00 -
83.58/83.67 c barrier LP : 0.00 0 0 0.00 - 0.00 0
83.58/83.67 c diving/probing LP: 0.00 0 0 0.00 -
83.58/83.67 c strong branching : 44.60 1559 189039 121.26 4238.79
83.58/83.67 c (at root node) : - 11 4990 453.64 -
83.58/83.67 c conflict analysis: 0.00 0 0 0.00 -
83.58/83.67 c B&B Tree :
83.58/83.67 c number of runs : 1
83.58/83.67 c nodes : 1185
83.58/83.67 c nodes (total) : 1185
83.58/83.67 c nodes left : 0
83.58/83.67 c max depth : 41
83.58/83.67 c max depth (total): 41
83.58/83.67 c backtracks : 315 (26.6%)
83.58/83.67 c delayed cutoffs : 454
83.58/83.67 c repropagations : 1011 (39114 domain reductions, 267 cutoffs)
83.58/83.67 c avg switch length: 3.91
83.58/83.67 c switching time : 0.35
83.58/83.67 c Solution :
83.58/83.67 c Solutions found : 0 (0 improvements)
83.58/83.67 c Primal Bound : infeasible
83.58/83.67 c Dual Bound : -
83.58/83.67 c Gap : 0.00 %
83.58/83.67 c Root Dual Bound : +0.00000000000000e+00
83.58/83.67 c Root Iterations : 10188
83.67/83.71 c Time complete: 83.69.