0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-3739878-1338732292.opb>
0.29/0.37 c original problem has 16198 variables (16198 bin, 0 int, 0 impl, 0 cont) and 55731 constraints
0.29/0.37 c problem read
0.29/0.37 c No objective function, only one solution is needed.
0.29/0.37 c presolving settings loaded
0.39/0.48 c presolving:
1.49/1.50 c (round 1) 5967 del vars, 17051 del conss, 4727 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2760512 impls, 0 clqs
1.79/1.83 c (round 2) 10635 del vars, 36202 del conss, 9007 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2791185 impls, 0 clqs
1.79/1.88 c (round 3) 12081 del vars, 42941 del conss, 9942 chg bounds, 45 chg sides, 38 chg coeffs, 0 upgd conss, 2801314 impls, 0 clqs
1.89/1.92 c (round 4) 13157 del vars, 46667 del conss, 10746 chg bounds, 82 chg sides, 63 chg coeffs, 0 upgd conss, 2811143 impls, 0 clqs
1.89/1.93 c (round 5) 13730 del vars, 48793 del conss, 11122 chg bounds, 93 chg sides, 76 chg coeffs, 0 upgd conss, 2816830 impls, 0 clqs
1.89/1.94 c (round 6) 14018 del vars, 49827 del conss, 11336 chg bounds, 101 chg sides, 85 chg coeffs, 0 upgd conss, 2819178 impls, 0 clqs
1.89/1.95 c (round 7) 14199 del vars, 50392 del conss, 11441 chg bounds, 122 chg sides, 111 chg coeffs, 0 upgd conss, 2821870 impls, 3 clqs
1.89/1.96 c (round 8) 14330 del vars, 50730 del conss, 11495 chg bounds, 154 chg sides, 139 chg coeffs, 0 upgd conss, 2827832 impls, 4 clqs
1.89/1.96 c (round 9) 14379 del vars, 50923 del conss, 11518 chg bounds, 159 chg sides, 143 chg coeffs, 0 upgd conss, 2828660 impls, 4 clqs
1.89/1.96 c (round 10) 14402 del vars, 51020 del conss, 11531 chg bounds, 169 chg sides, 152 chg coeffs, 0 upgd conss, 2829659 impls, 2 clqs
1.89/1.97 c (round 11) 14423 del vars, 51075 del conss, 11540 chg bounds, 174 chg sides, 158 chg coeffs, 0 upgd conss, 2829778 impls, 2 clqs
1.89/1.97 c (round 12) 14427 del vars, 51110 del conss, 11542 chg bounds, 176 chg sides, 160 chg coeffs, 0 upgd conss, 2829798 impls, 2 clqs
1.89/1.97 c (round 13) 14429 del vars, 51118 del conss, 11542 chg bounds, 176 chg sides, 160 chg coeffs, 0 upgd conss, 2829824 impls, 2 clqs
1.89/1.97 c (round 14) 14429 del vars, 51120 del conss, 11542 chg bounds, 176 chg sides, 160 chg coeffs, 0 upgd conss, 2829824 impls, 2 clqs
1.89/1.99 c (round 15) 14429 del vars, 51132 del conss, 11542 chg bounds, 176 chg sides, 160 chg coeffs, 4599 upgd conss, 2829824 impls, 2 clqs
1.99/2.01 c (round 16) 14478 del vars, 51194 del conss, 11547 chg bounds, 213 chg sides, 290 chg coeffs, 4599 upgd conss, 2831238 impls, 75 clqs
1.99/2.02 c (round 17) 14499 del vars, 51275 del conss, 11547 chg bounds, 223 chg sides, 361 chg coeffs, 4599 upgd conss, 2832102 impls, 101 clqs
1.99/2.02 c (round 18) 14523 del vars, 51305 del conss, 11552 chg bounds, 225 chg sides, 399 chg coeffs, 4599 upgd conss, 2833031 impls, 105 clqs
1.99/2.03 c (round 19) 14529 del vars, 51348 del conss, 11552 chg bounds, 232 chg sides, 447 chg coeffs, 4599 upgd conss, 2833281 impls, 110 clqs
1.99/2.04 c (round 20) 14529 del vars, 51349 del conss, 11552 chg bounds, 233 chg sides, 474 chg coeffs, 4599 upgd conss, 2833281 impls, 114 clqs
1.99/2.04 c (round 21) 14529 del vars, 51354 del conss, 11552 chg bounds, 233 chg sides, 488 chg coeffs, 4599 upgd conss, 2833281 impls, 115 clqs
1.99/2.05 c presolving (22 rounds):
1.99/2.05 c 14529 deleted vars, 51354 deleted constraints, 11552 tightened bounds, 0 added holes, 233 changed sides, 494 changed coefficients
1.99/2.05 c 2833281 implications, 118 cliques
1.99/2.05 c presolved problem has 1669 variables (1669 bin, 0 int, 0 impl, 0 cont) and 4377 constraints
1.99/2.05 c 223 constraints of type <knapsack>
1.99/2.05 c 3388 constraints of type <setppc>
1.99/2.05 c 766 constraints of type <logicor>
1.99/2.05 c transformed objective value is always integral (scale: 1)
1.99/2.05 c Presolving Time: 1.59
1.99/2.05 c - non default parameters ----------------------------------------------------------------------
1.99/2.05 c # SCIP version 1.2.1.3
1.99/2.05 c
1.99/2.05 c # frequency for displaying node information lines
1.99/2.05 c # [type: int, range: [-1,2147483647], default: 100]
1.99/2.05 c display/freq = 10000
1.99/2.05 c
1.99/2.05 c # maximal time in seconds to run
1.99/2.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.99/2.05 c limits/time = 1789.63
1.99/2.05 c
1.99/2.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.99/2.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.99/2.05 c limits/memory = 13950
1.99/2.05 c
1.99/2.05 c # solving stops, if the given number of solutions were found (-1: no limit)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: -1]
1.99/2.05 c limits/solutions = 1
1.99/2.05 c
1.99/2.05 c # maximal number of separation rounds per node (-1: unlimited)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: 5]
1.99/2.05 c separating/maxrounds = 1
1.99/2.05 c
1.99/2.05 c # maximal number of separation rounds in the root node (-1: unlimited)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: -1]
1.99/2.05 c separating/maxroundsroot = 5
1.99/2.05 c
1.99/2.05 c # default clock type (1: CPU user seconds, 2: wall clock time)
1.99/2.05 c # [type: int, range: [1,2], default: 1]
1.99/2.05 c timing/clocktype = 2
1.99/2.05 c
1.99/2.05 c # should presolving try to simplify inequalities
1.99/2.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.99/2.05 c constraints/linear/simplifyinequalities = TRUE
1.99/2.05 c
1.99/2.05 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
1.99/2.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.99/2.05 c constraints/indicator/addCouplingCons = TRUE
1.99/2.05 c
1.99/2.05 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.99/2.05 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.99/2.05 c constraints/knapsack/disaggregation = FALSE
1.99/2.05 c
1.99/2.05 c # should presolving try to simplify knapsacks
1.99/2.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.99/2.05 c constraints/knapsack/simplifyinequalities = TRUE
1.99/2.05 c
1.99/2.05 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: -1]
1.99/2.05 c presolving/probing/maxrounds = 0
1.99/2.05 c
1.99/2.05 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: 10]
1.99/2.05 c heuristics/coefdiving/freq = -1
1.99/2.05 c
1.99/2.05 c # maximal fraction of diving LP iterations compared to node LP iterations
1.99/2.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.99/2.05 c heuristics/coefdiving/maxlpiterquot = 0.075
1.99/2.05 c
1.99/2.05 c # additional number of allowed LP iterations
1.99/2.05 c # [type: int, range: [0,2147483647], default: 1000]
1.99/2.05 c heuristics/coefdiving/maxlpiterofs = 1500
1.99/2.05 c
1.99/2.05 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: 30]
1.99/2.05 c heuristics/crossover/freq = -1
1.99/2.05 c
1.99/2.05 c # number of nodes added to the contingent of the total nodes
1.99/2.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.99/2.05 c heuristics/crossover/nodesofs = 750
1.99/2.05 c
1.99/2.05 c # number of nodes without incumbent change that heuristic should wait
1.99/2.05 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.99/2.05 c heuristics/crossover/nwaitingnodes = 100
1.99/2.05 c
1.99/2.05 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.99/2.05 c # [type: real, range: [0,1], default: 0.1]
1.99/2.05 c heuristics/crossover/nodesquot = 0.15
1.99/2.05 c
1.99/2.05 c # minimum percentage of integer variables that have to be fixed
1.99/2.05 c # [type: real, range: [0,1], default: 0.666]
1.99/2.05 c heuristics/crossover/minfixingrate = 0.5
1.99/2.05 c
1.99/2.05 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: 20]
1.99/2.05 c heuristics/feaspump/freq = -1
1.99/2.05 c
1.99/2.05 c # additional number of allowed LP iterations
1.99/2.05 c # [type: int, range: [0,2147483647], default: 1000]
1.99/2.05 c heuristics/feaspump/maxlpiterofs = 2000
1.99/2.05 c
1.99/2.05 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: 10]
1.99/2.05 c heuristics/fracdiving/freq = -1
1.99/2.05 c
1.99/2.05 c # maximal fraction of diving LP iterations compared to node LP iterations
1.99/2.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.99/2.05 c heuristics/fracdiving/maxlpiterquot = 0.075
1.99/2.05 c
1.99/2.05 c # additional number of allowed LP iterations
1.99/2.05 c # [type: int, range: [0,2147483647], default: 1000]
1.99/2.05 c heuristics/fracdiving/maxlpiterofs = 1500
1.99/2.05 c
1.99/2.05 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: 10]
1.99/2.05 c heuristics/guideddiving/freq = -1
1.99/2.05 c
1.99/2.05 c # maximal fraction of diving LP iterations compared to node LP iterations
1.99/2.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.99/2.05 c heuristics/guideddiving/maxlpiterquot = 0.075
1.99/2.05 c
1.99/2.05 c # additional number of allowed LP iterations
1.99/2.05 c # [type: int, range: [0,2147483647], default: 1000]
1.99/2.05 c heuristics/guideddiving/maxlpiterofs = 1500
1.99/2.05 c
1.99/2.05 c # maximal fraction of diving LP iterations compared to node LP iterations
1.99/2.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.99/2.05 c heuristics/intdiving/maxlpiterquot = 0.075
1.99/2.05 c
1.99/2.05 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: 10]
1.99/2.05 c heuristics/intshifting/freq = -1
1.99/2.05 c
1.99/2.05 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: 10]
1.99/2.05 c heuristics/linesearchdiving/freq = -1
1.99/2.05 c
1.99/2.05 c # maximal fraction of diving LP iterations compared to node LP iterations
1.99/2.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.99/2.05 c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.99/2.05 c
1.99/2.05 c # additional number of allowed LP iterations
1.99/2.05 c # [type: int, range: [0,2147483647], default: 1000]
1.99/2.05 c heuristics/linesearchdiving/maxlpiterofs = 1500
1.99/2.05 c
1.99/2.05 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: 1]
1.99/2.05 c heuristics/nlp/freq = -1
1.99/2.05 c
1.99/2.05 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: 20]
1.99/2.05 c heuristics/objpscostdiving/freq = -1
1.99/2.05 c
1.99/2.05 c # maximal fraction of diving LP iterations compared to total iteration number
1.99/2.05 c # [type: real, range: [0,1], default: 0.01]
1.99/2.05 c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.99/2.05 c
1.99/2.05 c # additional number of allowed LP iterations
1.99/2.05 c # [type: int, range: [0,2147483647], default: 1000]
1.99/2.05 c heuristics/objpscostdiving/maxlpiterofs = 1500
1.99/2.05 c
1.99/2.05 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: 1]
1.99/2.05 c heuristics/oneopt/freq = -1
1.99/2.05 c
1.99/2.05 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: 10]
1.99/2.05 c heuristics/pscostdiving/freq = -1
1.99/2.05 c
1.99/2.05 c # maximal fraction of diving LP iterations compared to node LP iterations
1.99/2.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.99/2.05 c heuristics/pscostdiving/maxlpiterquot = 0.075
1.99/2.05 c
1.99/2.05 c # additional number of allowed LP iterations
1.99/2.05 c # [type: int, range: [0,2147483647], default: 1000]
1.99/2.05 c heuristics/pscostdiving/maxlpiterofs = 1500
1.99/2.05 c
1.99/2.05 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: 0]
1.99/2.05 c heuristics/rens/freq = -1
1.99/2.05 c
1.99/2.05 c # minimum percentage of integer variables that have to be fixable
1.99/2.05 c # [type: real, range: [0,1], default: 0.5]
1.99/2.05 c heuristics/rens/minfixingrate = 0.3
1.99/2.05 c
1.99/2.05 c # number of nodes added to the contingent of the total nodes
1.99/2.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.99/2.05 c heuristics/rens/nodesofs = 2000
1.99/2.05 c
1.99/2.05 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: 20]
1.99/2.05 c heuristics/rootsoldiving/freq = -1
1.99/2.05 c
1.99/2.05 c # maximal fraction of diving LP iterations compared to node LP iterations
1.99/2.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.99/2.05 c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.99/2.05 c
1.99/2.05 c # additional number of allowed LP iterations
1.99/2.05 c # [type: int, range: [0,2147483647], default: 1000]
1.99/2.05 c heuristics/rootsoldiving/maxlpiterofs = 1500
1.99/2.05 c
1.99/2.05 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: 1]
1.99/2.05 c heuristics/rounding/freq = -1
1.99/2.05 c
1.99/2.05 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: 10]
1.99/2.05 c heuristics/shifting/freq = -1
1.99/2.05 c
1.99/2.05 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: 1]
1.99/2.05 c heuristics/simplerounding/freq = -1
1.99/2.05 c
1.99/2.05 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: 0]
1.99/2.05 c heuristics/trivial/freq = -1
1.99/2.05 c
1.99/2.05 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: 1]
1.99/2.05 c heuristics/trysol/freq = -1
1.99/2.05 c
1.99/2.05 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: 10]
1.99/2.05 c heuristics/veclendiving/freq = -1
1.99/2.05 c
1.99/2.05 c # maximal fraction of diving LP iterations compared to node LP iterations
1.99/2.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.99/2.05 c heuristics/veclendiving/maxlpiterquot = 0.075
1.99/2.05 c
1.99/2.05 c # additional number of allowed LP iterations
1.99/2.05 c # [type: int, range: [0,2147483647], default: 1000]
1.99/2.05 c heuristics/veclendiving/maxlpiterofs = 1500
1.99/2.05 c
1.99/2.05 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: 1]
1.99/2.05 c heuristics/zirounding/freq = -1
1.99/2.05 c
1.99/2.05 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: 0]
1.99/2.05 c separating/cmir/freq = -1
1.99/2.05 c
1.99/2.05 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: 0]
1.99/2.05 c separating/flowcover/freq = -1
1.99/2.05 c
1.99/2.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.99/2.05 c # [type: int, range: [-1,2147483647], default: -1]
1.99/2.05 c separating/rapidlearning/freq = 0
1.99/2.05 c
1.99/2.05 c -----------------------------------------------------------------------------------------------
1.99/2.05 c start solving
1.99/2.05 c
2.39/2.44 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.39/2.44 c 2.1s| 1 | 0 | 2015 | - | 59M| 0 | 784 |1669 |4377 |1669 |4339 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
3.59/3.65 c 3.3s| 1 | 0 | 2115 | - | 60M| 0 | - |1669 |4417 |1669 |4339 | 0 | 0 | 0 | -- | -- | 0.00%
3.59/3.65 c 3.3s| 1 | 0 | 2115 | - | 60M| 0 | - |1669 |4417 |1669 |4339 | 0 | 0 | 0 | -- | -- | 0.00%
3.59/3.65 c
3.59/3.65 c SCIP Status : problem is solved [infeasible]
3.59/3.65 c Solving Time (sec) : 3.27
3.59/3.65 c Solving Nodes : 1
3.59/3.65 c Primal Bound : +1.00000000000000e+20 (0 solutions)
3.59/3.65 c Dual Bound : +1.00000000000000e+20
3.59/3.65 c Gap : 0.00 %
3.68/3.77 s UNSATISFIABLE
3.68/3.77 c SCIP Status : problem is solved [infeasible]
3.68/3.77 c Solving Time : 3.27
3.68/3.77 c Original Problem :
3.68/3.77 c Problem name : HOME/instance-3739878-1338732292.opb
3.68/3.77 c Variables : 16198 (16198 binary, 0 integer, 0 implicit integer, 0 continuous)
3.68/3.77 c Constraints : 55731 initial, 55731 maximal
3.68/3.77 c Presolved Problem :
3.68/3.77 c Problem name : t_HOME/instance-3739878-1338732292.opb
3.68/3.77 c Variables : 1669 (1669 binary, 0 integer, 0 implicit integer, 0 continuous)
3.68/3.77 c Constraints : 4377 initial, 4417 maximal
3.68/3.77 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.68/3.77 c trivial : 0.00 374 0 0 0 0 0 0 0
3.68/3.77 c dualfix : 0.01 97 0 0 0 0 0 0 0
3.68/3.77 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.68/3.77 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.68/3.77 c implics : 0.02 0 129 0 0 0 0 0 0
3.68/3.77 c probing : 0.00 0 0 0 0 0 0 0 0
3.68/3.77 c knapsack : 0.03 17 0 0 0 0 1 57 334
3.68/3.77 c setppc : 0.01 30 0 0 5 0 217 0 0
3.68/3.77 c linear : 1.44 11183 2699 0 11542 0 51132 176 160
3.68/3.77 c logicor : 0.02 0 0 0 5 0 4 0 0
3.68/3.77 c root node : - 214 - - 214 - - - -
3.68/3.77 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.68/3.77 c integral : 0 0 0 0 0 0 0 0 0 0
3.68/3.77 c knapsack : 223 1 1 0 0 0 0 134 0 0
3.68/3.77 c setppc : 3388 1 1 0 0 0 0 0 0 0
3.68/3.77 c linear : 0+ 0 0 0 0 0 0 0 0 0
3.68/3.77 c logicor : 766 1 1 0 0 0 0 0 0 0
3.68/3.77 c countsols : 0 0 0 0 0 0 0 0 0 0
3.68/3.77 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.68/3.77 c integral : 0.00 0.00 0.00 0.00 0.00
3.68/3.77 c knapsack : 0.00 0.00 0.00 0.00 0.00
3.68/3.77 c setppc : 0.00 0.00 0.00 0.00 0.00
3.68/3.77 c linear : 0.00 0.00 0.00 0.00 0.00
3.68/3.77 c logicor : 0.00 0.00 0.00 0.00 0.00
3.68/3.77 c countsols : 0.00 0.00 0.00 0.00 0.00
3.68/3.77 c Propagators : Time Calls Cutoffs DomReds
3.68/3.77 c vbounds : 0.00 1 0 0
3.68/3.77 c rootredcost : 0.00 0 0 0
3.68/3.77 c pseudoobj : 0.00 0 0 0
3.68/3.77 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.68/3.77 c propagation : 0.00 0 0 0 0.0 0 0.0 -
3.68/3.77 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.68/3.77 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.68/3.77 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.68/3.77 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.68/3.77 c applied globally : - - - 0 0.0 - - -
3.68/3.77 c applied locally : - - - 0 0.0 - - -
3.68/3.77 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.68/3.77 c cut pool : 0.00 0 - - 0 - (maximal pool size: 152)
3.68/3.77 c redcost : 0.00 1 0 0 0 0
3.68/3.77 c impliedbounds : 0.00 1 0 0 10 0
3.68/3.77 c intobj : 0.00 0 0 0 0 0
3.68/3.77 c cgmip : 0.00 0 0 0 0 0
3.68/3.77 c gomory : 0.59 1 0 0 0 0
3.68/3.77 c strongcg : 0.31 1 0 0 500 0
3.68/3.77 c cmir : 0.00 0 0 0 0 0
3.68/3.77 c flowcover : 0.00 0 0 0 0 0
3.68/3.77 c clique : 0.03 1 0 0 8 0
3.68/3.77 c zerohalf : 0.00 0 0 0 0 0
3.68/3.77 c mcf : 0.01 1 0 0 0 0
3.68/3.77 c rapidlearning : 0.21 1 0 214 0 40
3.68/3.77 c Pricers : Time Calls Vars
3.68/3.77 c problem variables: 0.00 0 0
3.68/3.77 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.68/3.77 c pscost : 0.00 0 0 0 0 0 0
3.68/3.77 c inference : 0.00 0 0 0 0 0 0
3.68/3.77 c mostinf : 0.00 0 0 0 0 0 0
3.68/3.77 c leastinf : 0.00 0 0 0 0 0 0
3.68/3.77 c fullstrong : 0.00 0 0 0 0 0 0
3.68/3.77 c allfullstrong : 0.00 0 0 0 0 0 0
3.68/3.77 c random : 0.00 0 0 0 0 0 0
3.68/3.77 c relpscost : 0.00 0 0 0 0 0 0
3.68/3.77 c Primal Heuristics : Time Calls Found
3.68/3.77 c LP solutions : 0.00 - 0
3.68/3.77 c pseudo solutions : 0.00 - 0
3.68/3.77 c trivial : 0.01 1 0
3.68/3.77 c simplerounding : 0.00 0 0
3.68/3.77 c zirounding : 0.00 0 0
3.68/3.77 c rounding : 0.00 0 0
3.68/3.77 c shifting : 0.00 0 0
3.68/3.77 c intshifting : 0.00 0 0
3.68/3.77 c oneopt : 0.00 0 0
3.68/3.77 c twoopt : 0.00 0 0
3.68/3.77 c fixandinfer : 0.00 0 0
3.68/3.77 c feaspump : 0.00 0 0
3.68/3.77 c coefdiving : 0.00 0 0
3.68/3.77 c pscostdiving : 0.00 0 0
3.68/3.77 c fracdiving : 0.00 0 0
3.68/3.77 c veclendiving : 0.00 0 0
3.68/3.77 c intdiving : 0.00 0 0
3.68/3.77 c actconsdiving : 0.00 0 0
3.68/3.77 c objpscostdiving : 0.00 0 0
3.68/3.77 c rootsoldiving : 0.00 0 0
3.68/3.77 c linesearchdiving : 0.00 0 0
3.68/3.77 c guideddiving : 0.00 0 0
3.68/3.77 c octane : 0.00 0 0
3.68/3.77 c rens : 0.00 0 0
3.68/3.77 c rins : 0.00 0 0
3.68/3.77 c localbranching : 0.00 0 0
3.68/3.77 c mutation : 0.00 0 0
3.68/3.77 c crossover : 0.00 0 0
3.68/3.77 c dins : 0.00 0 0
3.68/3.77 c undercover : 0.00 0 0
3.68/3.77 c nlp : 0.00 0 0
3.68/3.77 c trysol : 0.00 0 0
3.68/3.77 c LP : Time Calls Iterations Iter/call Iter/sec
3.68/3.77 c primal LP : 0.00 0 0 0.00 -
3.68/3.77 c dual LP : 0.43 2 2115 1057.50 4923.65
3.68/3.77 c lex dual LP : 0.00 0 0 0.00 -
3.68/3.77 c barrier LP : 0.00 0 0 0.00 -
3.68/3.77 c diving/probing LP: 0.00 0 0 0.00 -
3.68/3.77 c strong branching : 0.00 0 0 0.00 -
3.68/3.77 c (at root node) : - 0 0 0.00 -
3.68/3.77 c conflict analysis: 0.00 0 0 0.00 -
3.68/3.77 c B&B Tree :
3.68/3.77 c number of runs : 1
3.68/3.77 c nodes : 1
3.68/3.77 c nodes (total) : 1
3.68/3.77 c nodes left : 0
3.68/3.77 c max depth : 0
3.68/3.77 c max depth (total): 0
3.68/3.77 c backtracks : 0 (0.0%)
3.68/3.77 c delayed cutoffs : 0
3.68/3.77 c repropagations : 0 (0 domain reductions, 0 cutoffs)
3.68/3.77 c avg switch length: 2.00
3.68/3.77 c switching time : 0.00
3.68/3.77 c Solution :
3.68/3.77 c Solutions found : 0 (0 improvements)
3.68/3.77 c Primal Bound : infeasible
3.68/3.77 c Dual Bound : -
3.68/3.77 c Gap : 0.00 %
3.68/3.77 c Root Dual Bound : -
3.68/3.77 c Root Iterations : 2115
3.68/3.77 c Time complete: 3.69.