0.00/0.05 c SCIP version 1.1.0.7
0.00/0.05 c LP-Solver SoPlex 1.4.1
0.00/0.05 c user parameter file <scip.set> not found - using default parameters
0.00/0.05 c read problem <HOME/instance-1884637-1245259778.opb>
0.00/0.05 c original problem has 696 variables (696 bin, 0 int, 0 impl, 0 cont) and 3122 constraints
0.00/0.07 c No objective function, only one solution is needed.
0.00/0.07 c start presolving problem
0.00/0.07 c presolving:
0.07/0.09 c (round 1) 205 del vars, 90 del conss, 36 chg bounds, 0 chg sides, 8 chg coeffs, 0 upgd conss, 12818 impls, 0 clqs
0.09/0.11 c (round 2) 265 del vars, 1124 del conss, 84 chg bounds, 74 chg sides, 200 chg coeffs, 0 upgd conss, 16359 impls, 0 clqs
0.09/0.12 c (round 3) 309 del vars, 1368 del conss, 84 chg bounds, 74 chg sides, 200 chg coeffs, 0 upgd conss, 16403 impls, 0 clqs
0.09/0.19 c (round 4) 310 del vars, 1456 del conss, 84 chg bounds, 77 chg sides, 200 chg coeffs, 1683 upgd conss, 16403 impls, 0 clqs
0.19/0.20 c presolving (5 rounds):
0.19/0.20 c 310 deleted vars, 1456 deleted constraints, 84 tightened bounds, 0 added holes, 77 changed sides, 200 changed coefficients
0.19/0.20 c 16403 implications, 0 cliques
0.19/0.20 c presolved problem has 386 variables (386 bin, 0 int, 0 impl, 0 cont) and 1666 constraints
0.19/0.20 c 1666 constraints of type <logicor>
0.19/0.20 c transformed objective value is always integral (scale: 1)
0.19/0.20 c Presolving Time: 0.11
0.19/0.20 c PURESAT
0.19/0.20 c -----------------------------------------------------------------------------------------------
0.19/0.20 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.20 c separating/flowcover/freq = c -1
0.19/0.20 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.20 c separating/cmir/freq = c -1
0.19/0.20 c # additional number of allowed LP iterations
0.19/0.20 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.20 c heuristics/veclendiving/maxlpiterofs = c 1500
0.19/0.20 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.20 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.19/0.20 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.20 c heuristics/veclendiving/freq = c -1
0.19/0.20 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.20 c heuristics/simplerounding/freq = c -1
0.19/0.20 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.20 c heuristics/shifting/freq = c -1
0.19/0.20 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.20 c heuristics/rounding/freq = c -1
0.19/0.20 c # additional number of allowed LP iterations
0.19/0.20 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.20 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.19/0.20 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.19/0.20 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.19/0.20 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.20 c heuristics/rootsoldiving/freq = c -1
0.19/0.20 c # number of nodes added to the contingent of the total nodes
0.19/0.20 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.19/0.20 c heuristics/rens/nodesofs = c 2000
0.19/0.20 c # minimum percentage of integer variables that have to be fixable
0.19/0.20 c # [type: real, range: [0,1], default: 0.5]
0.19/0.20 c heuristics/rens/minfixingrate = c 0.3
0.19/0.20 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.20 c heuristics/rens/freq = c -1
0.19/0.20 c # additional number of allowed LP iterations
0.19/0.20 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.20 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.19/0.20 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.20 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.19/0.20 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.20 c heuristics/pscostdiving/freq = c -1
0.19/0.20 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.20 c heuristics/oneopt/freq = c -1
0.19/0.20 c # additional number of allowed LP iterations
0.19/0.20 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.20 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.19/0.20 c # maximal fraction of diving LP iterations compared to total iteration number
0.19/0.20 c # [type: real, range: [0,1], default: 0.01]
0.19/0.20 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.19/0.20 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.20 c heuristics/objpscostdiving/freq = c -1
0.19/0.20 c # additional number of allowed LP iterations
0.19/0.20 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.20 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.19/0.20 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.20 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.19/0.20 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.20 c heuristics/linesearchdiving/freq = c -1
0.19/0.20 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.20 c heuristics/intshifting/freq = c -1
0.19/0.20 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.20 c heuristics/intdiving/maxlpiterquot = c 0.075
0.19/0.20 c # additional number of allowed LP iterations
0.19/0.20 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.20 c heuristics/guideddiving/maxlpiterofs = c 1500
0.19/0.20 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.20 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.19/0.20 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.20 c heuristics/guideddiving/freq = c -1
0.19/0.20 c # additional number of allowed LP iterations
0.19/0.20 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.20 c heuristics/fracdiving/maxlpiterofs = c 1500
0.19/0.20 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.20 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.19/0.20 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.20 c heuristics/fracdiving/freq = c -1
0.19/0.20 c # additional number of allowed LP iterations
0.19/0.20 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.20 c heuristics/feaspump/maxlpiterofs = c 2000
0.19/0.20 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.20 c heuristics/feaspump/freq = c -1
0.19/0.20 c # minimum percentage of integer variables that have to be fixed
0.19/0.20 c # [type: real, range: [0,1], default: 0.666]
0.19/0.20 c heuristics/crossover/minfixingrate = c 0.5
0.19/0.20 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.19/0.20 c # [type: real, range: [0,1], default: 0.1]
0.19/0.20 c heuristics/crossover/nodesquot = c 0.15
0.19/0.20 c # number of nodes without incumbent change that heuristic should wait
0.19/0.20 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.19/0.20 c heuristics/crossover/nwaitingnodes = c 100
0.19/0.20 c # number of nodes added to the contingent of the total nodes
0.19/0.20 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.19/0.20 c heuristics/crossover/nodesofs = c 750
0.19/0.20 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 30]
0.19/0.20 c heuristics/crossover/freq = c -1
0.19/0.20 c # additional number of allowed LP iterations
0.19/0.20 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.20 c heuristics/coefdiving/maxlpiterofs = c 1500
0.19/0.20 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.20 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.19/0.20 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.20 c heuristics/coefdiving/freq = c -1
0.19/0.20 c # priority of node selection rule <dfs> in standard mode
0.19/0.20 c # [type: int, range: [-536870912,536870911], default: 0]
0.19/0.20 c nodeselection/dfs/stdpriority = c 1000000
0.19/0.20 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.20 c presolving/probing/maxrounds = c 0
0.19/0.20 c # should presolving try to simplify knapsacks
0.19/0.20 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.20 c constraints/knapsack/simplifyinequalities = c TRUE
0.19/0.20 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.19/0.20 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.19/0.20 c constraints/knapsack/disaggregation = c FALSE
0.19/0.20 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.20 c constraints/knapsack/maxnumcardlift = c 0
0.19/0.20 c # should presolving try to simplify inequalities
0.19/0.20 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.20 c constraints/linear/simplifyinequalities = c TRUE
0.19/0.20 c # maximal number of separation rounds in the root node (-1: unlimited)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.20 c separating/maxroundsroot = c 5
0.19/0.20 c # maximal number of separation rounds per node (-1: unlimited)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 5]
0.19/0.20 c separating/maxrounds = c 1
0.19/0.20 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.19/0.20 c # [type: char, range: {lafpsqd}, default: l]
0.19/0.20 c lp/pricing = c a
0.19/0.20 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.20 c lp/solvefreq = c 0
0.19/0.20 c # solving stops, if the given number of solutions were found (-1: no limit)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.20 c limits/solutions = c 1
0.19/0.20 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.19/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.20 c limits/memory = c 1620
0.19/0.20 c # maximal time in seconds to run
0.19/0.20 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.20 c limits/time = c 1791
0.19/0.20 c # frequency for displaying node information lines
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 100]
0.19/0.20 c display/freq = c 10000
0.19/0.20 c # should enforcement of pseudo solution be disabled?
0.19/0.20 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.20 c constraints/disableenfops = c TRUE
0.19/0.20 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.20 c constraints/agelimit = c 1
0.19/0.20 c # should binary conflicts be preferred?
0.19/0.20 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.20 c conflict/preferbinary = c TRUE
0.19/0.20 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.19/0.20 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.20 c conflict/interconss = c 0
0.19/0.20 c -----------------------------------------------------------------------------------------------
0.19/0.20 c start solving problem
0.19/0.20 c
0.19/0.28 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.28 c 0.2s| 1 | 0 | 503 |4086k| 0 | 153 | 386 |1666 |1666 | 386 |1666 | 0 | 0 | 0 | 1.392500e+02 | -- | Inf
0.29/0.38 c 0.3s| 1 | 0 | 600 |4179k| 0 | 147 | 386 |1666 |1666 | 386 |1676 | 10 | 0 | 0 | 1.434583e+02 | -- | Inf
0.39/0.49 c 0.4s| 1 | 0 | 745 |4262k| 0 | 178 | 386 |1666 |1666 | 386 |1688 | 22 | 0 | 0 | 1.478125e+02 | -- | Inf
0.48/0.59 c 0.5s| 1 | 0 | 818 |4584k| 0 | 169 | 386 |1666 |1666 | 386 |1698 | 32 | 0 | 0 | 1.500278e+02 | -- | Inf
0.69/0.73 c 0.6s| 1 | 0 | 966 |4985k| 0 | 211 | 386 |1666 |1666 | 386 |1716 | 50 | 0 | 0 | 1.541250e+02 | -- | Inf
0.79/0.89 c 0.8s| 1 | 0 | 1145 |5335k| 0 | 203 | 386 |1666 |1666 | 386 |1733 | 67 | 0 | 0 | 1.562279e+02 | -- | Inf
2.79/2.89 c 2.8s| 1 | 2 | 1145 |5336k| 0 | 203 | 386 |1666 |1666 | 386 |1733 | 67 | 0 | 17 | 1.562279e+02 | -- | Inf
2.98/3.00 c
2.98/3.00 c SCIP Status : problem is solved [infeasible]
2.98/3.00 c Solving Time (sec) : 2.89
2.98/3.00 c Solving Nodes : 180
2.98/3.00 c Primal Bound : +1.00000000000000e+20 (0 solutions)
2.98/3.00 c Dual Bound : +1.00000000000000e+20
2.98/3.00 c Gap : 0.00 %
2.98/3.00 c NODE 180
2.98/3.00 c DUAL BOUND 1e+20
2.98/3.00 c PRIMAL BOUND 1e+20
2.98/3.00 c GAP 0
2.98/3.00 s UNSATISFIABLE
2.98/3.00 c SCIP Status : problem is solved [infeasible]
2.98/3.00 c Solving Time : 2.89
2.98/3.00 c Original Problem :
2.98/3.00 c Problem name : HOME/instance-1884637-1245259778.opb
2.98/3.00 c Variables : 696 (696 binary, 0 integer, 0 implicit integer, 0 continuous)
2.98/3.00 c Constraints : 3122 initial, 3122 maximal
2.98/3.00 c Presolved Problem :
2.98/3.00 c Problem name : t_HOME/instance-1884637-1245259778.opb
2.98/3.00 c Variables : 386 (386 binary, 0 integer, 0 implicit integer, 0 continuous)
2.98/3.00 c Constraints : 1666 initial, 1687 maximal
2.98/3.00 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.98/3.00 c trivial : 0.00 62 0 0 0 0 0 0 0
2.98/3.00 c dualfix : 0.00 1 0 0 0 0 0 0 0
2.98/3.00 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.98/3.00 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.98/3.00 c implics : 0.01 0 213 0 0 0 0 0 0
2.98/3.00 c probing : 0.00 0 0 0 0 0 0 0 0
2.98/3.00 c linear : 0.05 22 12 0 84 0 1439 77 200
2.98/3.00 c logicor : 0.04 0 0 0 0 0 17 0 0
2.98/3.00 c root node : - 273 - - 273 - - - -
2.98/3.00 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.98/3.00 c integral : 0 0 0 1 0 0 0 0 0 2
2.98/3.00 c logicor : 1666+ 5 1450 0 0 105 7968 0 0 0
2.98/3.00 c countsols : 0 0 0 0 0 0 0 0 0 0
2.98/3.00 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.98/3.00 c integral : 1.98 0.00 0.00 1.98 0.00
2.98/3.00 c logicor : 0.05 0.00 0.05 0.00 0.00
2.98/3.00 c countsols : 0.00 0.00 0.00 0.00 0.00
2.98/3.00 c Propagators : Time Calls Cutoffs DomReds
2.98/3.00 c rootredcost : 0.00 0 0 0
2.98/3.00 c pseudoobj : 0.06 1610 0 0
2.98/3.00 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.98/3.00 c propagation : 0.01 105 94 94 3.3 38 3.9 -
2.98/3.00 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.98/3.00 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.98/3.00 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.98/3.00 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.98/3.00 c applied globally : - - - 132 3.4 - - -
2.98/3.00 c applied locally : - - - 0 0.0 - - -
2.98/3.00 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.98/3.00 c cut pool : 0.00 4 - - 85 - (maximal pool size: 931)
2.98/3.00 c redcost : 0.00 5 0 0 0 0
2.98/3.00 c impliedbounds : 0.00 5 0 0 0 0
2.98/3.00 c intobj : 0.00 0 0 0 0 0
2.98/3.00 c gomory : 0.18 5 0 0 2500 0
2.98/3.00 c strongcg : 0.18 5 0 0 2500 0
2.98/3.00 c cmir : 0.00 0 0 0 0 0
2.98/3.00 c flowcover : 0.00 0 0 0 0 0
2.98/3.00 c clique : 0.01 5 0 0 32 0
2.98/3.00 c zerohalf : 0.00 0 0 0 0 0
2.98/3.00 c mcf : 0.00 1 0 0 0 0
2.98/3.00 c Pricers : Time Calls Vars
2.98/3.00 c problem variables: 0.00 0 0
2.98/3.00 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.98/3.00 c relpscost : 1.98 1 0 0 0 0 2
2.98/3.00 c pscost : 0.00 0 0 0 0 0 0
2.98/3.00 c inference : 0.00 118 0 0 0 0 236
2.98/3.00 c mostinf : 0.00 0 0 0 0 0 0
2.98/3.00 c leastinf : 0.00 0 0 0 0 0 0
2.98/3.00 c fullstrong : 0.00 0 0 0 0 0 0
2.98/3.00 c allfullstrong : 0.00 0 0 0 0 0 0
2.98/3.00 c random : 0.00 0 0 0 0 0 0
2.98/3.00 c Primal Heuristics : Time Calls Found
2.98/3.00 c LP solutions : 0.00 - 0
2.98/3.00 c pseudo solutions : 0.00 - 0
2.98/3.00 c simplerounding : 0.00 0 0
2.98/3.00 c rounding : 0.00 0 0
2.98/3.00 c shifting : 0.00 0 0
2.98/3.00 c intshifting : 0.00 0 0
2.98/3.00 c oneopt : 0.00 0 0
2.98/3.00 c fixandinfer : 0.00 0 0
2.98/3.00 c feaspump : 0.00 0 0
2.98/3.00 c coefdiving : 0.00 0 0
2.98/3.00 c pscostdiving : 0.00 0 0
2.98/3.00 c fracdiving : 0.00 0 0
2.98/3.00 c veclendiving : 0.00 0 0
2.98/3.00 c intdiving : 0.00 0 0
2.98/3.00 c actconsdiving : 0.00 0 0
2.98/3.00 c objpscostdiving : 0.00 0 0
2.98/3.00 c rootsoldiving : 0.00 0 0
2.98/3.00 c linesearchdiving : 0.00 0 0
2.98/3.00 c guideddiving : 0.00 0 0
2.98/3.00 c octane : 0.00 0 0
2.98/3.00 c rens : 0.00 0 0
2.98/3.00 c rins : 0.00 0 0
2.98/3.00 c localbranching : 0.00 0 0
2.98/3.00 c mutation : 0.00 0 0
2.98/3.00 c crossover : 0.00 0 0
2.98/3.00 c dins : 0.00 0 0
2.98/3.00 c LP : Time Calls Iterations Iter/call Iter/sec
2.98/3.00 c primal LP : 0.00 0 0 0.00 -
2.98/3.00 c dual LP : 0.29 6 1145 190.83 3948.28
2.98/3.00 c barrier LP : 0.00 0 0 0.00 -
2.98/3.00 c diving/probing LP: 0.00 0 0 0.00 -
2.98/3.00 c strong branching : 1.98 17 6211 365.35 3136.87
2.98/3.00 c (at root node) : - 17 6211 365.35 -
2.98/3.00 c conflict analysis: 0.00 0 0 0.00 -
2.98/3.00 c B&B Tree :
2.98/3.00 c number of runs : 1
2.98/3.00 c nodes : 180
2.98/3.00 c nodes (total) : 180
2.98/3.00 c nodes left : 0
2.98/3.00 c max depth : 15
2.98/3.00 c max depth (total): 15
2.98/3.00 c backtracks : 48 (26.7%)
2.98/3.00 c delayed cutoffs : 59
2.98/3.00 c repropagations : 204 (2837 domain reductions, 44 cutoffs)
2.98/3.00 c avg switch length: 3.28
2.98/3.00 c switching time : 0.00
2.98/3.00 c Solution :
2.98/3.00 c Solutions found : 0 (0 improvements)
2.98/3.00 c Primal Bound : infeasible
2.98/3.00 c Dual Bound : -
2.98/3.00 c Gap : 0.00 %
2.98/3.00 c Root Dual Bound : +1.56227859834671e+02
2.98/3.02 c Time complete: 3.01.