0.39/0.44 c SCIP version 1.1.0.7
0.39/0.44 c LP-Solver SoPlex 1.4.1
0.39/0.44 c user parameter file <scip.set> not found - using default parameters
0.39/0.44 c read problem <HOME/instance-1884627-1245259772.opb>
0.39/0.44 c original problem has 267 variables (267 bin, 0 int, 0 impl, 0 cont) and 23747 constraints
0.49/0.52 c No objective function, only one solution is needed.
0.49/0.52 c start presolving problem
0.49/0.52 c presolving:
0.59/0.65 c (round 1) 68 del vars, 116 del conss, 64 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1110 impls, 0 clqs
0.69/0.73 c (round 2) 68 del vars, 11636 del conss, 64 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1110 impls, 0 clqs
1.79/1.85 c (round 3) 68 del vars, 16223 del conss, 64 chg bounds, 0 chg sides, 0 chg coeffs, 11841 upgd conss, 1110 impls, 0 clqs
2.29/2.36 c (round 4) 68 del vars, 17569 del conss, 64 chg bounds, 0 chg sides, 0 chg coeffs, 11841 upgd conss, 1110 impls, 0 clqs
2.39/2.44 c (round 5) 68 del vars, 17673 del conss, 64 chg bounds, 0 chg sides, 0 chg coeffs, 11841 upgd conss, 1110 impls, 0 clqs
2.39/2.49 c (round 6) 68 del vars, 17713 del conss, 64 chg bounds, 0 chg sides, 0 chg coeffs, 11841 upgd conss, 1110 impls, 0 clqs
2.49/2.53 c (round 7) 68 del vars, 17723 del conss, 64 chg bounds, 0 chg sides, 0 chg coeffs, 11841 upgd conss, 1110 impls, 0 clqs
2.49/2.55 c (round 8) 68 del vars, 17725 del conss, 64 chg bounds, 0 chg sides, 0 chg coeffs, 11841 upgd conss, 1110 impls, 0 clqs
2.59/2.67 c (round 9) 68 del vars, 18021 del conss, 64 chg bounds, 0 chg sides, 0 chg coeffs, 11841 upgd conss, 1110 impls, 0 clqs
2.59/2.67 c presolving (10 rounds):
2.59/2.67 c 68 deleted vars, 18021 deleted constraints, 64 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.59/2.67 c 1110 implications, 0 cliques
2.59/2.67 c presolved problem has 199 variables (199 bin, 0 int, 0 impl, 0 cont) and 5726 constraints
2.59/2.67 c 15 constraints of type <linear>
2.59/2.67 c 5711 constraints of type <logicor>
2.59/2.67 c transformed objective value is always integral (scale: 1)
2.59/2.67 c Presolving Time: 2.07
2.59/2.67 c SATUNSAT-LIN
2.59/2.67 c -----------------------------------------------------------------------------------------------
2.59/2.67 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
2.59/2.67 c # [type: int, range: [-1,2147483647], default: 0]
2.59/2.67 c separating/flowcover/freq = c -1
2.59/2.67 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
2.59/2.67 c # [type: int, range: [-1,2147483647], default: 0]
2.59/2.67 c separating/cmir/freq = c -1
2.59/2.67 c # additional number of allowed LP iterations
2.59/2.67 c # [type: int, range: [0,2147483647], default: 1000]
2.59/2.67 c heuristics/veclendiving/maxlpiterofs = c 1500
2.59/2.67 c # maximal fraction of diving LP iterations compared to node LP iterations
2.59/2.67 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.59/2.67 c heuristics/veclendiving/maxlpiterquot = c 0.075
2.59/2.67 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
2.59/2.67 c # [type: int, range: [-1,2147483647], default: 10]
2.59/2.67 c heuristics/veclendiving/freq = c -1
2.59/2.67 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
2.59/2.67 c # [type: int, range: [-1,2147483647], default: 1]
2.59/2.67 c heuristics/simplerounding/freq = c -1
2.59/2.67 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
2.59/2.67 c # [type: int, range: [-1,2147483647], default: 10]
2.59/2.67 c heuristics/shifting/freq = c -1
2.59/2.67 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
2.59/2.67 c # [type: int, range: [-1,2147483647], default: 1]
2.59/2.67 c heuristics/rounding/freq = c -1
2.59/2.67 c # additional number of allowed LP iterations
2.59/2.67 c # [type: int, range: [0,2147483647], default: 1000]
2.59/2.67 c heuristics/rootsoldiving/maxlpiterofs = c 1500
2.59/2.67 c # maximal fraction of diving LP iterations compared to node LP iterations
2.59/2.67 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
2.59/2.67 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
2.59/2.67 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
2.59/2.67 c # [type: int, range: [-1,2147483647], default: 20]
2.59/2.67 c heuristics/rootsoldiving/freq = c -1
2.59/2.67 c # number of nodes added to the contingent of the total nodes
2.59/2.67 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.59/2.67 c heuristics/rens/nodesofs = c 2000
2.59/2.67 c # minimum percentage of integer variables that have to be fixable
2.59/2.67 c # [type: real, range: [0,1], default: 0.5]
2.59/2.67 c heuristics/rens/minfixingrate = c 0.3
2.59/2.67 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
2.59/2.67 c # [type: int, range: [-1,2147483647], default: 0]
2.59/2.67 c heuristics/rens/freq = c -1
2.59/2.67 c # additional number of allowed LP iterations
2.59/2.67 c # [type: int, range: [0,2147483647], default: 1000]
2.59/2.67 c heuristics/pscostdiving/maxlpiterofs = c 1500
2.59/2.67 c # maximal fraction of diving LP iterations compared to node LP iterations
2.59/2.67 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.59/2.67 c heuristics/pscostdiving/maxlpiterquot = c 0.075
2.59/2.67 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
2.59/2.67 c # [type: int, range: [-1,2147483647], default: 10]
2.59/2.67 c heuristics/pscostdiving/freq = c -1
2.59/2.67 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
2.59/2.67 c # [type: int, range: [-1,2147483647], default: 1]
2.59/2.67 c heuristics/oneopt/freq = c -1
2.59/2.67 c # additional number of allowed LP iterations
2.59/2.67 c # [type: int, range: [0,2147483647], default: 1000]
2.59/2.67 c heuristics/objpscostdiving/maxlpiterofs = c 1500
2.59/2.67 c # maximal fraction of diving LP iterations compared to total iteration number
2.59/2.67 c # [type: real, range: [0,1], default: 0.01]
2.59/2.67 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
2.59/2.67 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
2.59/2.67 c # [type: int, range: [-1,2147483647], default: 20]
2.59/2.67 c heuristics/objpscostdiving/freq = c -1
2.59/2.67 c # additional number of allowed LP iterations
2.59/2.67 c # [type: int, range: [0,2147483647], default: 1000]
2.59/2.67 c heuristics/linesearchdiving/maxlpiterofs = c 1500
2.59/2.67 c # maximal fraction of diving LP iterations compared to node LP iterations
2.59/2.67 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.59/2.67 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
2.59/2.67 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
2.59/2.67 c # [type: int, range: [-1,2147483647], default: 10]
2.59/2.67 c heuristics/linesearchdiving/freq = c -1
2.59/2.67 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
2.59/2.67 c # [type: int, range: [-1,2147483647], default: 10]
2.59/2.67 c heuristics/intshifting/freq = c -1
2.59/2.67 c # maximal fraction of diving LP iterations compared to node LP iterations
2.59/2.67 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.59/2.67 c heuristics/intdiving/maxlpiterquot = c 0.075
2.59/2.67 c # additional number of allowed LP iterations
2.59/2.67 c # [type: int, range: [0,2147483647], default: 1000]
2.59/2.67 c heuristics/guideddiving/maxlpiterofs = c 1500
2.59/2.67 c # maximal fraction of diving LP iterations compared to node LP iterations
2.59/2.67 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.59/2.67 c heuristics/guideddiving/maxlpiterquot = c 0.075
2.59/2.67 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
2.59/2.67 c # [type: int, range: [-1,2147483647], default: 10]
2.59/2.67 c heuristics/guideddiving/freq = c -1
2.59/2.67 c # additional number of allowed LP iterations
2.59/2.67 c # [type: int, range: [0,2147483647], default: 1000]
2.59/2.67 c heuristics/fracdiving/maxlpiterofs = c 1500
2.59/2.67 c # maximal fraction of diving LP iterations compared to node LP iterations
2.59/2.67 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.59/2.67 c heuristics/fracdiving/maxlpiterquot = c 0.075
2.59/2.67 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
2.59/2.67 c # [type: int, range: [-1,2147483647], default: 10]
2.59/2.67 c heuristics/fracdiving/freq = c -1
2.59/2.67 c # additional number of allowed LP iterations
2.59/2.67 c # [type: int, range: [0,2147483647], default: 1000]
2.59/2.67 c heuristics/feaspump/maxlpiterofs = c 2000
2.59/2.67 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
2.59/2.67 c # [type: int, range: [-1,2147483647], default: 20]
2.59/2.67 c heuristics/feaspump/freq = c -1
2.59/2.67 c # minimum percentage of integer variables that have to be fixed
2.59/2.67 c # [type: real, range: [0,1], default: 0.666]
2.59/2.67 c heuristics/crossover/minfixingrate = c 0.5
2.59/2.67 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
2.59/2.67 c # [type: real, range: [0,1], default: 0.1]
2.59/2.67 c heuristics/crossover/nodesquot = c 0.15
2.59/2.67 c # number of nodes without incumbent change that heuristic should wait
2.59/2.67 c # [type: longint, range: [0,9223372036854775807], default: 200]
2.59/2.67 c heuristics/crossover/nwaitingnodes = c 100
2.59/2.67 c # number of nodes added to the contingent of the total nodes
2.59/2.67 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.59/2.67 c heuristics/crossover/nodesofs = c 750
2.59/2.67 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
2.59/2.67 c # [type: int, range: [-1,2147483647], default: 30]
2.59/2.67 c heuristics/crossover/freq = c -1
2.59/2.67 c # additional number of allowed LP iterations
2.59/2.67 c # [type: int, range: [0,2147483647], default: 1000]
2.59/2.67 c heuristics/coefdiving/maxlpiterofs = c 1500
2.59/2.67 c # maximal fraction of diving LP iterations compared to node LP iterations
2.59/2.67 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.59/2.67 c heuristics/coefdiving/maxlpiterquot = c 0.075
2.59/2.67 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
2.59/2.67 c # [type: int, range: [-1,2147483647], default: 10]
2.59/2.67 c heuristics/coefdiving/freq = c -1
2.59/2.67 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
2.59/2.67 c # [type: int, range: [-1,2147483647], default: -1]
2.59/2.67 c presolving/probing/maxrounds = c 0
2.59/2.67 c # should presolving try to simplify knapsacks
2.59/2.67 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.59/2.67 c constraints/knapsack/simplifyinequalities = c TRUE
2.59/2.67 c # should disaggregation of knapsack constraints be allowed in preprocessing?
2.59/2.67 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
2.59/2.67 c constraints/knapsack/disaggregation = c FALSE
2.59/2.67 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
2.59/2.67 c # [type: int, range: [-1,2147483647], default: -1]
2.59/2.67 c constraints/knapsack/maxnumcardlift = c 0
2.59/2.67 c # should presolving try to simplify inequalities
2.59/2.68 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.59/2.68 c constraints/linear/simplifyinequalities = c TRUE
2.59/2.68 c # maximal number of separation rounds in the root node (-1: unlimited)
2.59/2.68 c # [type: int, range: [-1,2147483647], default: -1]
2.59/2.68 c separating/maxroundsroot = c 5
2.59/2.68 c # maximal number of separation rounds per node (-1: unlimited)
2.59/2.68 c # [type: int, range: [-1,2147483647], default: 5]
2.59/2.68 c separating/maxrounds = c 1
2.59/2.68 c # solving stops, if the given number of solutions were found (-1: no limit)
2.59/2.68 c # [type: int, range: [-1,2147483647], default: -1]
2.59/2.68 c limits/solutions = c 1
2.59/2.68 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
2.59/2.68 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.59/2.68 c limits/memory = c 1620
2.59/2.68 c # maximal time in seconds to run
2.59/2.68 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.59/2.68 c limits/time = c 1791
2.59/2.68 c # frequency for displaying node information lines
2.59/2.68 c # [type: int, range: [-1,2147483647], default: 100]
2.59/2.68 c display/freq = c 10000
2.59/2.68 c -----------------------------------------------------------------------------------------------
2.59/2.68 c start solving problem
2.59/2.68 c
2.69/2.76 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.69/2.76 c 2.2s| 1 | 0 | 136 | 18M| 0 | 71 | 199 |5726 |5726 | 199 |5726 | 0 | 0 | 0 | 6.400000e+01 | -- | Inf
2.89/2.94 c 2.4s| 1 | 0 | 162 | 18M| 0 | 72 | 199 |5726 |5726 | 199 |5734 | 8 | 0 | 0 | 6.533333e+01 | -- | Inf
3.09/3.12 c 2.6s| 1 | 0 | 188 | 18M| 0 | 73 | 199 |5726 |5726 | 199 |5742 | 16 | 0 | 0 | 6.550000e+01 | -- | Inf
3.29/3.39 c 2.8s| 1 | 0 | 240 | 18M| 0 | 109 | 199 |5726 |5726 | 199 |5742 | 111 | 0 | 0 | 6.666667e+01 | -- | Inf
3.88/3.99 c 3.4s| 1 | 0 | 337 | 18M| 0 | 97 | 199 |5726 |5726 | 199 |5752 | 121 | 0 | 0 | 6.833333e+01 | -- | Inf
4.40/4.44 c 3.9s| 1 | 0 | 492 | 19M| 0 | 69 | 199 |5726 |5726 | 199 |5763 | 132 | 0 | 0 | 6.933333e+01 | -- | Inf
7.99/8.01 c 7.4s| 1 | 2 | 492 | 19M| 0 | 69 | 199 |5726 |5726 | 199 |5763 | 132 | 0 | 26 | 6.933333e+01 | -- | Inf
191.62/191.79 c 190s| 10000 | 4524 |107905 | 31M| 34 | 24 | 199 |7352 |3888 | 199 |5746 | 132 |8264 |1861 | 7.500000e+01 | -- | Inf
307.98/308.15 c 306s| 20000 | 5488 |195507 | 35M| 34 | - | 199 |7941 |1639 | 0 | 0 | 132 | 21k|2017 | 7.766667e+01 | -- | Inf
427.75/427.94 c
427.75/427.94 c SCIP Status : problem is solved [infeasible]
427.75/427.94 c Solving Time (sec) : 425.12
427.75/427.94 c Solving Nodes : 29865
427.75/427.94 c Primal Bound : +1.00000000000000e+20 (0 solutions)
427.75/427.94 c Dual Bound : +1.00000000000000e+20
427.75/427.94 c Gap : 0.00 %
427.75/427.95 c NODE 29865
427.75/427.95 c DUAL BOUND 1e+20
427.75/427.95 c PRIMAL BOUND 1e+20
427.75/427.95 c GAP 0
427.75/427.95 s UNSATISFIABLE
427.75/427.95 c SCIP Status : problem is solved [infeasible]
427.75/427.95 c Solving Time : 425.12
427.75/427.95 c Original Problem :
427.75/427.95 c Problem name : HOME/instance-1884627-1245259772.opb
427.75/427.95 c Variables : 267 (267 binary, 0 integer, 0 implicit integer, 0 continuous)
427.75/427.95 c Constraints : 23747 initial, 23747 maximal
427.75/427.95 c Presolved Problem :
427.75/427.95 c Problem name : t_HOME/instance-1884627-1245259772.opb
427.75/427.95 c Variables : 199 (199 binary, 0 integer, 0 implicit integer, 0 continuous)
427.75/427.95 c Constraints : 5726 initial, 8338 maximal
427.75/427.95 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
427.75/427.95 c trivial : 0.01 0 0 0 0 0 0 0 0
427.75/427.95 c dualfix : 0.00 4 0 0 0 0 0 0 0
427.75/427.95 c boundshift : 0.00 0 0 0 0 0 0 0 0
427.75/427.95 c inttobinary : 0.00 0 0 0 0 0 0 0 0
427.75/427.95 c implics : 0.00 0 0 0 0 0 0 0 0
427.75/427.95 c probing : 0.00 0 0 0 0 0 0 0 0
427.75/427.95 c linear : 0.21 64 0 0 64 0 11891 0 0
427.75/427.95 c logicor : 1.81 0 0 0 0 0 6130 0 0
427.75/427.95 c root node : - 1 - - 1 - - - -
427.75/427.95 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
427.75/427.95 c integral : 0 0 0 20742 0 80 918 0 0 39848
427.75/427.95 c linear : 15 5 136658 0 0 514 3664 0 0 0
427.75/427.95 c logicor : 5711+ 5 121229 0 0 14356 360710 0 0 0
427.75/427.95 c countsols : 0 0 0 0 0 0 0 0 0 0
427.75/427.95 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
427.75/427.95 c integral : 70.48 0.00 0.00 70.48 0.00
427.75/427.95 c linear : 0.55 0.00 0.55 0.00 0.00
427.75/427.95 c logicor : 29.66 0.01 29.65 0.00 0.00
427.75/427.95 c countsols : 0.00 0.00 0.00 0.00 0.00
427.75/427.95 c Propagators : Time Calls Cutoffs DomReds
427.75/427.95 c rootredcost : 0.07 0 0 0
427.75/427.95 c pseudoobj : 1.75 136783 0 0
427.75/427.95 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
427.75/427.95 c propagation : 1.22 14870 14836 81136 20.3 2339 9.7 -
427.75/427.95 c infeasible LP : 0.02 18 18 86 15.0 10 4.7 0
427.75/427.95 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
427.75/427.95 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
427.75/427.95 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
427.75/427.95 c applied globally : - - - 41437 15.3 - - -
427.75/427.95 c applied locally : - - - 5 38.8 - - -
427.75/427.95 c Separators : Time Calls Cutoffs DomReds Cuts Conss
427.75/427.95 c cut pool : 0.00 4 - - 24 - (maximal pool size: 552)
427.75/427.95 c redcost : 0.25 20035 0 0 0 0
427.75/427.95 c impliedbounds : 0.00 5 0 0 0 0
427.75/427.95 c intobj : 0.00 0 0 0 0 0
427.75/427.95 c gomory : 0.66 5 0 0 2500 0
427.75/427.95 c strongcg : 0.62 5 0 0 2500 0
427.75/427.95 c cmir : 0.00 0 0 0 0 0
427.75/427.95 c flowcover : 0.00 0 0 0 0 0
427.75/427.95 c clique : 0.00 5 0 0 31 0
427.75/427.95 c zerohalf : 0.00 0 0 0 0 0
427.75/427.95 c mcf : 0.00 1 0 0 0 0
427.75/427.95 c Pricers : Time Calls Vars
427.75/427.95 c problem variables: 0.00 0 0
427.75/427.95 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
427.75/427.95 c relpscost : 70.44 20742 80 918 0 0 39848
427.75/427.95 c pscost : 0.00 0 0 0 0 0 0
427.75/427.95 c inference : 0.00 0 0 0 0 0 0
427.75/427.95 c mostinf : 0.00 0 0 0 0 0 0
427.75/427.95 c leastinf : 0.00 0 0 0 0 0 0
427.75/427.95 c fullstrong : 0.00 0 0 0 0 0 0
427.75/427.95 c allfullstrong : 0.00 0 0 0 0 0 0
427.75/427.95 c random : 0.00 0 0 0 0 0 0
427.75/427.95 c Primal Heuristics : Time Calls Found
427.75/427.95 c LP solutions : 0.00 - 0
427.75/427.95 c pseudo solutions : 0.00 - 0
427.75/427.95 c simplerounding : 0.00 0 0
427.75/427.95 c rounding : 0.00 0 0
427.75/427.95 c shifting : 0.00 0 0
427.75/427.95 c intshifting : 0.00 0 0
427.75/427.95 c oneopt : 0.00 0 0
427.75/427.95 c fixandinfer : 0.00 0 0
427.75/427.95 c feaspump : 0.00 0 0
427.75/427.95 c coefdiving : 0.00 0 0
427.75/427.95 c pscostdiving : 0.00 0 0
427.75/427.95 c fracdiving : 0.00 0 0
427.75/427.95 c veclendiving : 0.00 0 0
427.75/427.95 c intdiving : 0.00 0 0
427.75/427.95 c actconsdiving : 0.00 0 0
427.75/427.95 c objpscostdiving : 0.00 0 0
427.75/427.95 c rootsoldiving : 0.00 0 0
427.75/427.95 c linesearchdiving : 0.00 0 0
427.75/427.95 c guideddiving : 0.00 0 0
427.75/427.95 c octane : 0.00 0 0
427.75/427.95 c rens : 0.00 0 0
427.75/427.95 c rins : 0.00 0 0
427.75/427.95 c localbranching : 0.00 0 0
427.75/427.95 c mutation : 0.00 0 0
427.75/427.95 c crossover : 0.00 0 0
427.75/427.95 c dins : 0.00 0 0
427.75/427.95 c LP : Time Calls Iterations Iter/call Iter/sec
427.75/427.95 c primal LP : 0.01 0 0 0.00 0.00
427.75/427.95 c dual LP : 258.70 20763 269333 12.97 1041.10
427.75/427.95 c barrier LP : 0.00 0 0 0.00 -
427.75/427.95 c diving/probing LP: 0.00 0 0 0.00 -
427.75/427.95 c strong branching : 69.51 2409 55881 23.20 803.93
427.75/427.95 c (at root node) : - 26 3775 145.19 -
427.75/427.95 c conflict analysis: 0.00 0 0 0.00 -
427.75/427.95 c B&B Tree :
427.75/427.95 c number of runs : 1
427.75/427.95 c nodes : 29865
427.75/427.95 c nodes (total) : 29865
427.75/427.95 c nodes left : 0
427.75/427.95 c max depth : 34
427.75/427.95 c max depth (total): 34
427.75/427.95 c backtracks : 10842 (36.3%)
427.75/427.95 c delayed cutoffs : 9984
427.75/427.95 c repropagations : 27729 (112907 domain reductions, 5027 cutoffs)
427.75/427.95 c avg switch length: 10.91
427.75/427.95 c switching time : 17.10
427.75/427.95 c Solution :
427.75/427.95 c Solutions found : 0 (0 improvements)
427.75/427.95 c Primal Bound : infeasible
427.75/427.95 c Dual Bound : -
427.75/427.95 c Gap : 0.00 %
427.75/427.95 c Root Dual Bound : +6.93333333333333e+01
427.85/428.00 c Time complete: 427.85.