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-3690506-1338016946.opb>
0.00/0.04 c original problem has 6059 variables (6059 bin, 0 int, 0 impl, 0 cont) and 16684 constraints
0.00/0.04 c problem read in 0.04
0.00/0.04 c No objective function, only one solution is needed.
0.00/0.04 c presolving settings loaded
0.09/0.11 c presolving:
0.18/0.29 c (round 1) 1234 del vars, 2261 del conss, 0 add conss, 773 chg bounds, 372 chg sides, 878 chg coeffs, 0 upgd conss, 298456 impls, 0 clqs
0.29/0.33 c (round 2) 1262 del vars, 3404 del conss, 0 add conss, 795 chg bounds, 373 chg sides, 880 chg coeffs, 0 upgd conss, 298562 impls, 0 clqs
0.29/0.34 c (round 3) 1265 del vars, 3413 del conss, 0 add conss, 796 chg bounds, 374 chg sides, 881 chg coeffs, 0 upgd conss, 298654 impls, 0 clqs
0.29/0.35 c (round 4) 1266 del vars, 3420 del conss, 0 add conss, 796 chg bounds, 374 chg sides, 881 chg coeffs, 0 upgd conss, 298834 impls, 0 clqs
0.29/0.36 c (round 5) 1266 del vars, 3422 del conss, 0 add conss, 796 chg bounds, 374 chg sides, 881 chg coeffs, 0 upgd conss, 298834 impls, 0 clqs
0.39/0.47 c (round 6) 1266 del vars, 3477 del conss, 0 add conss, 796 chg bounds, 374 chg sides, 881 chg coeffs, 13228 upgd conss, 298834 impls, 0 clqs
0.48/0.51 c (round 7) 1266 del vars, 3480 del conss, 0 add conss, 796 chg bounds, 374 chg sides, 881 chg coeffs, 13228 upgd conss, 298834 impls, 0 clqs
0.48/0.58 c (round 8) 1266 del vars, 15845 del conss, 4120 add conss, 796 chg bounds, 374 chg sides, 881 chg coeffs, 13228 upgd conss, 298834 impls, 0 clqs
0.59/0.61 c (round 9) 1332 del vars, 16209 del conss, 4484 add conss, 796 chg bounds, 374 chg sides, 881 chg coeffs, 13228 upgd conss, 305350 impls, 4 clqs
0.59/0.63 c (round 10) 1345 del vars, 16217 del conss, 4484 add conss, 796 chg bounds, 374 chg sides, 884 chg coeffs, 13238 upgd conss, 305672 impls, 368 clqs
0.59/0.64 c (round 11) 1348 del vars, 16220 del conss, 4484 add conss, 796 chg bounds, 374 chg sides, 887 chg coeffs, 13238 upgd conss, 305672 impls, 369 clqs
0.59/0.66 c (round 12) 1386 del vars, 16301 del conss, 4564 add conss, 796 chg bounds, 374 chg sides, 887 chg coeffs, 13238 upgd conss, 312562 impls, 369 clqs
0.59/0.67 c (round 13) 1394 del vars, 16305 del conss, 4564 add conss, 796 chg bounds, 374 chg sides, 887 chg coeffs, 13238 upgd conss, 312562 impls, 382 clqs
0.59/0.68 c (round 14) 1400 del vars, 16325 del conss, 4564 add conss, 796 chg bounds, 374 chg sides, 892 chg coeffs, 13238 upgd conss, 312562 impls, 382 clqs
0.59/0.70 c (round 15) 1402 del vars, 16362 del conss, 4601 add conss, 796 chg bounds, 374 chg sides, 892 chg coeffs, 13238 upgd conss, 312562 impls, 382 clqs
0.69/0.71 c (round 16) 1403 del vars, 16364 del conss, 4601 add conss, 796 chg bounds, 374 chg sides, 892 chg coeffs, 13238 upgd conss, 312562 impls, 383 clqs
0.69/0.71 c (round 17) 1404 del vars, 16365 del conss, 4601 add conss, 796 chg bounds, 374 chg sides, 893 chg coeffs, 13238 upgd conss, 312562 impls, 383 clqs
0.69/0.73 c (round 18) 1405 del vars, 16366 del conss, 4602 add conss, 796 chg bounds, 374 chg sides, 893 chg coeffs, 13238 upgd conss, 312562 impls, 383 clqs
0.69/0.75 c (round 19) 1406 del vars, 16367 del conss, 4603 add conss, 796 chg bounds, 374 chg sides, 893 chg coeffs, 13238 upgd conss, 312562 impls, 383 clqs
0.89/0.92 c (round 20) 1429 del vars, 16391 del conss, 4604 add conss, 796 chg bounds, 374 chg sides, 893 chg coeffs, 13238 upgd conss, 313136 impls, 383 clqs
0.99/1.09 c (round 21) 1434 del vars, 16397 del conss, 4604 add conss, 796 chg bounds, 374 chg sides, 893 chg coeffs, 13238 upgd conss, 313178 impls, 383 clqs
1.19/1.25 c (round 22) 1439 del vars, 16402 del conss, 4604 add conss, 796 chg bounds, 374 chg sides, 893 chg coeffs, 13238 upgd conss, 313210 impls, 383 clqs
1.39/1.42 c (round 23) 1444 del vars, 16407 del conss, 4604 add conss, 796 chg bounds, 374 chg sides, 893 chg coeffs, 13238 upgd conss, 313240 impls, 383 clqs
1.49/1.59 c (round 24) 1448 del vars, 16411 del conss, 4604 add conss, 796 chg bounds, 374 chg sides, 893 chg coeffs, 13238 upgd conss, 313258 impls, 383 clqs
1.69/1.75 c (round 25) 1451 del vars, 16414 del conss, 4604 add conss, 796 chg bounds, 374 chg sides, 893 chg coeffs, 13238 upgd conss, 313330 impls, 383 clqs
1.89/1.92 c (round 26) 1453 del vars, 16416 del conss, 4604 add conss, 796 chg bounds, 374 chg sides, 893 chg coeffs, 13238 upgd conss, 313378 impls, 383 clqs
2.09/2.11 c presolving (27 rounds):
2.09/2.11 c 1453 deleted vars, 16416 deleted constraints, 4604 added constraints, 796 tightened bounds, 0 added holes, 374 changed sides, 893 changed coefficients
2.09/2.11 c 313378 implications, 383 cliques
2.09/2.11 c presolved problem has 4606 variables (4606 bin, 0 int, 0 impl, 0 cont) and 4859 constraints
2.09/2.11 c 716 constraints of type <knapsack>
2.09/2.11 c 585 constraints of type <setppc>
2.09/2.11 c 3553 constraints of type <and>
2.09/2.11 c 5 constraints of type <logicor>
2.09/2.11 c transformed objective value is always integral (scale: 1)
2.09/2.11 c Presolving Time: 2.04
2.09/2.11 c - non default parameters ----------------------------------------------------------------------
2.09/2.11 c # SCIP version 2.1.1.4
2.09/2.11 c
2.09/2.11 c # maximal time in seconds to run
2.09/2.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.09/2.11 c limits/time = 1797
2.09/2.11 c
2.09/2.11 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
2.09/2.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.09/2.11 c limits/memory = 13950
2.09/2.11 c
2.09/2.11 c # solving stops, if the given number of solutions were found (-1: no limit)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: -1]
2.09/2.11 c limits/solutions = 1
2.09/2.11 c
2.09/2.11 c # maximal number of separation rounds per node (-1: unlimited)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 5]
2.09/2.11 c separating/maxrounds = 1
2.09/2.11 c
2.09/2.11 c # maximal number of separation rounds in the root node (-1: unlimited)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: -1]
2.09/2.11 c separating/maxroundsroot = 5
2.09/2.11 c
2.09/2.11 c # default clock type (1: CPU user seconds, 2: wall clock time)
2.09/2.11 c # [type: int, range: [1,2], default: 1]
2.09/2.11 c timing/clocktype = 2
2.09/2.11 c
2.09/2.11 c # belongs reading time to solving time?
2.09/2.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.09/2.11 c timing/reading = TRUE
2.09/2.11 c
2.09/2.11 c # should disaggregation of knapsack constraints be allowed in preprocessing?
2.09/2.11 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
2.09/2.11 c constraints/knapsack/disaggregation = FALSE
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 10]
2.09/2.11 c heuristics/coefdiving/freq = -1
2.09/2.11 c
2.09/2.11 c # maximal fraction of diving LP iterations compared to node LP iterations
2.09/2.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.09/2.11 c heuristics/coefdiving/maxlpiterquot = 0.075
2.09/2.11 c
2.09/2.11 c # additional number of allowed LP iterations
2.09/2.11 c # [type: int, range: [0,2147483647], default: 1000]
2.09/2.11 c heuristics/coefdiving/maxlpiterofs = 1500
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 30]
2.09/2.11 c heuristics/crossover/freq = -1
2.09/2.11 c
2.09/2.11 c # number of nodes added to the contingent of the total nodes
2.09/2.11 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.09/2.11 c heuristics/crossover/nodesofs = 750
2.09/2.11 c
2.09/2.11 c # number of nodes without incumbent change that heuristic should wait
2.09/2.11 c # [type: longint, range: [0,9223372036854775807], default: 200]
2.09/2.11 c heuristics/crossover/nwaitingnodes = 100
2.09/2.11 c
2.09/2.11 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
2.09/2.11 c # [type: real, range: [0,1], default: 0.1]
2.09/2.11 c heuristics/crossover/nodesquot = 0.15
2.09/2.11 c
2.09/2.11 c # minimum percentage of integer variables that have to be fixed
2.09/2.11 c # [type: real, range: [0,1], default: 0.666]
2.09/2.11 c heuristics/crossover/minfixingrate = 0.5
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 20]
2.09/2.11 c heuristics/feaspump/freq = -1
2.09/2.11 c
2.09/2.11 c # additional number of allowed LP iterations
2.09/2.11 c # [type: int, range: [0,2147483647], default: 1000]
2.09/2.11 c heuristics/feaspump/maxlpiterofs = 2000
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 10]
2.09/2.11 c heuristics/fracdiving/freq = -1
2.09/2.11 c
2.09/2.11 c # maximal fraction of diving LP iterations compared to node LP iterations
2.09/2.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.09/2.11 c heuristics/fracdiving/maxlpiterquot = 0.075
2.09/2.11 c
2.09/2.11 c # additional number of allowed LP iterations
2.09/2.11 c # [type: int, range: [0,2147483647], default: 1000]
2.09/2.11 c heuristics/fracdiving/maxlpiterofs = 1500
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 10]
2.09/2.11 c heuristics/guideddiving/freq = -1
2.09/2.11 c
2.09/2.11 c # maximal fraction of diving LP iterations compared to node LP iterations
2.09/2.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.09/2.11 c heuristics/guideddiving/maxlpiterquot = 0.075
2.09/2.11 c
2.09/2.11 c # additional number of allowed LP iterations
2.09/2.11 c # [type: int, range: [0,2147483647], default: 1000]
2.09/2.11 c heuristics/guideddiving/maxlpiterofs = 1500
2.09/2.11 c
2.09/2.11 c # maximal fraction of diving LP iterations compared to node LP iterations
2.09/2.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.09/2.11 c heuristics/intdiving/maxlpiterquot = 0.075
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 10]
2.09/2.11 c heuristics/intshifting/freq = -1
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 10]
2.09/2.11 c heuristics/linesearchdiving/freq = -1
2.09/2.11 c
2.09/2.11 c # maximal fraction of diving LP iterations compared to node LP iterations
2.09/2.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.09/2.11 c heuristics/linesearchdiving/maxlpiterquot = 0.075
2.09/2.11 c
2.09/2.11 c # additional number of allowed LP iterations
2.09/2.11 c # [type: int, range: [0,2147483647], default: 1000]
2.09/2.11 c heuristics/linesearchdiving/maxlpiterofs = 1500
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 20]
2.09/2.11 c heuristics/objpscostdiving/freq = -1
2.09/2.11 c
2.09/2.11 c # maximal fraction of diving LP iterations compared to total iteration number
2.09/2.11 c # [type: real, range: [0,1], default: 0.01]
2.09/2.11 c heuristics/objpscostdiving/maxlpiterquot = 0.015
2.09/2.11 c
2.09/2.11 c # additional number of allowed LP iterations
2.09/2.11 c # [type: int, range: [0,2147483647], default: 1000]
2.09/2.11 c heuristics/objpscostdiving/maxlpiterofs = 1500
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 1]
2.09/2.11 c heuristics/oneopt/freq = -1
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 10]
2.09/2.11 c heuristics/pscostdiving/freq = -1
2.09/2.11 c
2.09/2.11 c # maximal fraction of diving LP iterations compared to node LP iterations
2.09/2.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.09/2.11 c heuristics/pscostdiving/maxlpiterquot = 0.075
2.09/2.11 c
2.09/2.11 c # additional number of allowed LP iterations
2.09/2.11 c # [type: int, range: [0,2147483647], default: 1000]
2.09/2.11 c heuristics/pscostdiving/maxlpiterofs = 1500
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 0]
2.09/2.11 c heuristics/rens/freq = -1
2.09/2.11 c
2.09/2.11 c # minimum percentage of integer variables that have to be fixable
2.09/2.11 c # [type: real, range: [0,1], default: 0.5]
2.09/2.11 c heuristics/rens/minfixingrate = 0.3
2.09/2.11 c
2.09/2.11 c # number of nodes added to the contingent of the total nodes
2.09/2.11 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.09/2.11 c heuristics/rens/nodesofs = 2000
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 20]
2.09/2.11 c heuristics/rootsoldiving/freq = -1
2.09/2.11 c
2.09/2.11 c # maximal fraction of diving LP iterations compared to node LP iterations
2.09/2.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
2.09/2.11 c heuristics/rootsoldiving/maxlpiterquot = 0.015
2.09/2.11 c
2.09/2.11 c # additional number of allowed LP iterations
2.09/2.11 c # [type: int, range: [0,2147483647], default: 1000]
2.09/2.11 c heuristics/rootsoldiving/maxlpiterofs = 1500
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 1]
2.09/2.11 c heuristics/rounding/freq = -1
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 0]
2.09/2.11 c heuristics/shiftandpropagate/freq = -1
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 10]
2.09/2.11 c heuristics/shifting/freq = -1
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 1]
2.09/2.11 c heuristics/simplerounding/freq = -1
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 1]
2.09/2.11 c heuristics/subnlp/freq = -1
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 0]
2.09/2.11 c heuristics/trivial/freq = -1
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 1]
2.09/2.11 c heuristics/trysol/freq = -1
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 0]
2.09/2.11 c heuristics/undercover/freq = -1
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 10]
2.09/2.11 c heuristics/veclendiving/freq = -1
2.09/2.11 c
2.09/2.11 c # maximal fraction of diving LP iterations compared to node LP iterations
2.09/2.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.09/2.11 c heuristics/veclendiving/maxlpiterquot = 0.075
2.09/2.11 c
2.09/2.11 c # additional number of allowed LP iterations
2.09/2.11 c # [type: int, range: [0,2147483647], default: 1000]
2.09/2.11 c heuristics/veclendiving/maxlpiterofs = 1500
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 1]
2.09/2.11 c heuristics/zirounding/freq = -1
2.09/2.11 c
2.09/2.11 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: -1]
2.09/2.11 c propagating/probing/maxprerounds = 0
2.09/2.11 c
2.09/2.11 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 0]
2.09/2.11 c separating/cmir/freq = -1
2.09/2.11 c
2.09/2.11 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 0]
2.09/2.11 c separating/flowcover/freq = -1
2.09/2.11 c
2.09/2.11 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: -1]
2.09/2.11 c separating/rapidlearning/freq = 0
2.09/2.11 c
2.09/2.11 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
2.09/2.11 c # [type: int, range: [-1,2147483647], default: 1]
2.09/2.11 c heuristics/indoneopt/freq = -1
2.09/2.11 c
2.09/2.11 c -----------------------------------------------------------------------------------------------
2.09/2.11 c start solving
2.09/2.11 c
2.20/2.21 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.20/2.21 c 2.2s| 1 | 0 | 974 | - | 38M| 0 | 802 |4606 |4859 |4606 |8412 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
3.09/3.12 c 3.1s| 1 | 0 | 1208 | - | 33M| 0 | - |4606 |4900 |4606 |8412 | 0 | 0 | 0 | cutoff | -- | 0.00%
3.09/3.12 c 3.1s| 1 | 0 | 1208 | - | 33M| 0 | - |4606 |4900 |4606 |8412 | 0 | 0 | 0 | cutoff | -- | 0.00%
3.09/3.12 c
3.09/3.12 c SCIP Status : problem is solved [infeasible]
3.09/3.12 c Solving Time (sec) : 3.12
3.09/3.12 c Solving Nodes : 1
3.09/3.12 c Primal Bound : +1.00000000000000e+20 (0 solutions)
3.09/3.12 c Dual Bound : +1.00000000000000e+20
3.09/3.12 c Gap : 0.00 %
3.09/3.12 s UNSATISFIABLE
3.09/3.12 c SCIP Status : problem is solved [infeasible]
3.09/3.12 c Total Time : 3.12
3.09/3.12 c solving : 3.12
3.09/3.12 c presolving : 2.04 (included in solving)
3.09/3.12 c reading : 0.04 (included in solving)
3.09/3.12 c copying : 0.02 (1 #copies) (minimal 0.02, maximal 0.02, average 0.02)
3.09/3.12 c Original Problem :
3.09/3.12 c Problem name : HOME/instance-3690506-1338016946.opb
3.09/3.12 c Variables : 6059 (6059 binary, 0 integer, 0 implicit integer, 0 continuous)
3.09/3.12 c Constraints : 16684 initial, 16684 maximal
3.09/3.12 c Objective sense : minimize
3.09/3.12 c Presolved Problem :
3.09/3.12 c Problem name : t_HOME/instance-3690506-1338016946.opb
3.09/3.12 c Variables : 4606 (4606 binary, 0 integer, 0 implicit integer, 0 continuous)
3.09/3.12 c Constraints : 4859 initial, 4900 maximal
3.09/3.12 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
3.09/3.12 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
3.09/3.12 c trivial : 0.01 0.00 13 0 0 0 0 0 0 0 0
3.09/3.12 c dualfix : 0.00 0.00 1 0 0 0 0 0 0 0 0
3.09/3.12 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
3.09/3.12 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
3.09/3.12 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
3.09/3.12 c gateextraction : 0.04 0.00 0 0 0 0 0 12365 4120 0 0
3.09/3.12 c implics : 0.04 0.00 0 456 0 0 0 0 0 0 0
3.09/3.12 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
3.09/3.12 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
3.09/3.12 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
3.09/3.12 c knapsack : 0.03 0.00 0 0 0 0 0 0 0 0 0
3.09/3.12 c setppc : 0.06 0.00 0 0 0 0 0 30 0 0 0
3.09/3.12 c and : 1.44 0.00 15 162 0 0 0 544 484 0 12
3.09/3.12 c linear : 0.29 0.00 796 10 0 796 0 3477 0 374 881
3.09/3.12 c logicor : 0.05 0.00 0 0 0 0 0 0 0 0 0
3.09/3.12 c root node : - - 2949 - - 2949 - - - - -
3.09/3.12 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
3.09/3.12 c integral : 0 0 0 0 0 0 1 0 0 0 0 0 0
3.09/3.12 c knapsack : 716 716 1 1 0 0 0 0 0 0 200 0 0
3.09/3.12 c setppc : 585 585 1 1 0 0 0 0 0 0 0 0 0
3.09/3.12 c and : 3553 3553 1 1 0 0 0 0 0 0 193 0 0
3.09/3.12 c linear : 0+ 41 0 0 0 0 0 0 0 0 0 0 0
3.09/3.12 c logicor : 5 5 1 1 0 0 0 0 0 0 0 0 0
3.09/3.12 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0
3.09/3.12 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
3.09/3.12 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
3.09/3.12 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
3.09/3.12 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
3.09/3.12 c and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
3.09/3.12 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
3.09/3.12 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
3.09/3.12 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
3.09/3.12 c Propagators : #Propagate #ResProp Cutoffs DomReds
3.09/3.12 c rootredcost : 0 0 0 0
3.09/3.12 c pseudoobj : 0 0 0 0
3.09/3.12 c vbounds : 0 0 0 0
3.09/3.12 c redcost : 1 0 0 0
3.09/3.12 c probing : 0 0 0 0
3.09/3.12 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
3.09/3.12 c rootredcost : 0.00 0.00 0.00 0.00 0.00
3.09/3.12 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
3.09/3.12 c vbounds : 0.00 0.00 0.00 0.00 0.00
3.09/3.12 c redcost : 0.00 0.00 0.00 0.00 0.00
3.09/3.12 c probing : 0.00 0.00 0.00 0.00 0.00
3.09/3.12 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.09/3.12 c propagation : 0.00 0 0 0 0.0 0 0.0 -
3.09/3.12 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.09/3.12 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.09/3.12 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.09/3.12 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.09/3.12 c applied globally : - - - 0 0.0 - - -
3.09/3.12 c applied locally : - - - 0 0.0 - - -
3.09/3.12 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
3.09/3.12 c cut pool : 0.00 0 - - 0 - (maximal pool size: 816)
3.09/3.12 c closecuts : 0.00 0.00 0 0 0 0 0
3.09/3.12 c impliedbounds : 0.00 0.00 1 0 0 894 0
3.09/3.12 c intobj : 0.00 0.00 0 0 0 0 0
3.09/3.12 c gomory : 0.02 0.00 1 0 0 50 0
3.09/3.12 c cgmip : 0.00 0.00 0 0 0 0 0
3.09/3.12 c strongcg : 0.06 0.00 1 0 0 500 0
3.09/3.12 c cmir : 0.00 0.00 0 0 0 0 0
3.09/3.12 c flowcover : 0.00 0.00 0 0 0 0 0
3.09/3.12 c clique : 0.17 0.00 1 0 0 7 0
3.09/3.12 c zerohalf : 0.00 0.00 0 0 0 0 0
3.09/3.12 c mcf : 0.01 0.00 1 0 0 0 0
3.09/3.12 c oddcycle : 0.00 0.00 0 0 0 0 0
3.09/3.12 c rapidlearning : 0.63 0.00 1 0 2949 0 41
3.09/3.12 c Pricers : ExecTime SetupTime Calls Vars
3.09/3.12 c problem variables: 0.00 - 0 0
3.09/3.12 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
3.09/3.12 c pscost : 0.00 0.00 0 0 0 0 0 0
3.09/3.12 c inference : 0.00 0.00 0 0 0 0 0 0
3.09/3.12 c mostinf : 0.00 0.00 0 0 0 0 0 0
3.09/3.12 c leastinf : 0.00 0.00 0 0 0 0 0 0
3.09/3.12 c fullstrong : 0.00 0.00 0 0 0 0 0 0
3.09/3.12 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
3.09/3.12 c random : 0.00 0.00 0 0 0 0 0 0
3.09/3.12 c relpscost : 0.00 0.00 0 0 0 0 0 0
3.09/3.12 c Primal Heuristics : ExecTime SetupTime Calls Found
3.09/3.12 c LP solutions : 0.00 - - 0
3.09/3.12 c pseudo solutions : 0.00 - - 0
3.09/3.12 c smallcard : 0.00 0.00 0 0
3.09/3.12 c trivial : 0.00 0.00 1 0
3.09/3.12 c shiftandpropagate: 0.00 0.00 0 0
3.09/3.12 c simplerounding : 0.00 0.00 0 0
3.09/3.12 c zirounding : 0.00 0.00 0 0
3.09/3.12 c rounding : 0.00 0.00 0 0
3.09/3.12 c shifting : 0.00 0.00 0 0
3.09/3.12 c intshifting : 0.00 0.00 0 0
3.09/3.12 c oneopt : 0.00 0.00 0 0
3.09/3.12 c twoopt : 0.00 0.00 0 0
3.09/3.12 c indtwoopt : 0.00 0.00 0 0
3.09/3.12 c indoneopt : 0.00 0.00 0 0
3.09/3.12 c fixandinfer : 0.00 0.00 0 0
3.09/3.12 c feaspump : 0.00 0.00 0 0
3.09/3.12 c clique : 0.00 0.00 0 0
3.09/3.12 c indrounding : 0.00 0.00 0 0
3.09/3.12 c indcoefdiving : 0.00 0.00 0 0
3.09/3.12 c coefdiving : 0.00 0.00 0 0
3.09/3.12 c pscostdiving : 0.00 0.00 0 0
3.09/3.12 c nlpdiving : 0.00 0.00 0 0
3.09/3.12 c fracdiving : 0.00 0.00 0 0
3.09/3.12 c veclendiving : 0.00 0.00 0 0
3.09/3.12 c intdiving : 0.00 0.00 0 0
3.09/3.12 c actconsdiving : 0.00 0.00 0 0
3.09/3.12 c objpscostdiving : 0.00 0.00 0 0
3.09/3.12 c rootsoldiving : 0.00 0.00 0 0
3.09/3.12 c linesearchdiving : 0.00 0.00 0 0
3.09/3.12 c guideddiving : 0.00 0.00 0 0
3.09/3.12 c octane : 0.00 0.00 0 0
3.09/3.12 c rens : 0.00 0.00 0 0
3.09/3.12 c rins : 0.00 0.00 0 0
3.09/3.12 c localbranching : 0.00 0.00 0 0
3.09/3.12 c mutation : 0.00 0.00 0 0
3.09/3.12 c crossover : 0.00 0.00 0 0
3.09/3.12 c dins : 0.00 0.00 0 0
3.09/3.12 c vbounds : 0.00 0.00 0 0
3.09/3.12 c undercover : 0.00 0.00 0 0
3.09/3.12 c subnlp : 0.00 0.00 0 0
3.09/3.12 c trysol : 0.00 0.00 0 0
3.09/3.12 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
3.09/3.12 c primal LP : 0.00 0 0 0.00 - 0.00 0
3.09/3.12 c dual LP : 0.09 2 1208 604.00 13159.18 0.00 0
3.09/3.12 c lex dual LP : 0.00 0 0 0.00 -
3.09/3.12 c barrier LP : 0.00 0 0 0.00 - 0.00 0
3.09/3.13 c diving/probing LP: 0.00 0 0 0.00 -
3.09/3.13 c strong branching : 0.00 0 0 0.00 -
3.09/3.13 c (at root node) : - 0 0 0.00 -
3.09/3.13 c conflict analysis: 0.00 0 0 0.00 -
3.09/3.13 c B&B Tree :
3.09/3.13 c number of runs : 1
3.09/3.13 c nodes : 1
3.09/3.13 c nodes (total) : 1
3.09/3.13 c nodes left : 0
3.09/3.13 c max depth : 0
3.09/3.13 c max depth (total): 0
3.09/3.13 c backtracks : 0 (0.0%)
3.09/3.13 c delayed cutoffs : 0
3.09/3.13 c repropagations : 0 (0 domain reductions, 0 cutoffs)
3.09/3.13 c avg switch length: 2.00
3.09/3.13 c switching time : 0.00
3.09/3.13 c Solution :
3.09/3.13 c Solutions found : 0 (0 improvements)
3.09/3.13 c Primal Bound : infeasible
3.09/3.13 c Dual Bound : -
3.09/3.13 c Gap : 0.00 %
3.09/3.13 c Root Dual Bound : -
3.09/3.13 c Root Iterations : 1208
3.09/3.18 c Time complete: 3.18.