0.09/0.14 c SCIP version 1.1.0.7
0.09/0.14 c LP-Solver SoPlex 1.4.1
0.09/0.14 c user parameter file <scip.set> not found - using default parameters
0.09/0.14 c read problem <HOME/instance-1884367-1245257552.opb>
0.09/0.14 c original problem has 2306 variables (2306 bin, 0 int, 0 impl, 0 cont) and 8931 constraints
0.09/0.17 c No objective function, only one solution is needed.
0.09/0.17 c start presolving problem
0.09/0.17 c presolving:
0.19/0.22 c (round 1) 270 del vars, 36 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 11090 impls, 0 clqs
0.19/0.27 c (round 2) 600 del vars, 1626 del conss, 330 chg bounds, 630 chg sides, 1008 chg coeffs, 0 upgd conss, 11844 impls, 0 clqs
0.19/0.28 c (round 3) 606 del vars, 1908 del conss, 336 chg bounds, 630 chg sides, 1008 chg coeffs, 0 upgd conss, 11844 impls, 0 clqs
0.29/0.35 c (round 4) 606 del vars, 1908 del conss, 336 chg bounds, 630 chg sides, 1008 chg coeffs, 7023 upgd conss, 11844 impls, 0 clqs
0.29/0.37 c presolving (5 rounds):
0.29/0.37 c 606 deleted vars, 1908 deleted constraints, 336 tightened bounds, 0 added holes, 630 changed sides, 1008 changed coefficients
0.29/0.37 c 11844 implications, 0 cliques
0.29/0.37 c presolved problem has 1700 variables (1700 bin, 0 int, 0 impl, 0 cont) and 7023 constraints
0.29/0.37 c 7023 constraints of type <logicor>
0.29/0.37 c transformed objective value is always integral (scale: 1)
0.29/0.37 c Presolving Time: 0.16
0.29/0.37 c PURESAT
0.29/0.37 c -----------------------------------------------------------------------------------------------
0.29/0.37 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.37 c separating/flowcover/freq = c -1
0.29/0.37 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.37 c separating/cmir/freq = c -1
0.29/0.37 c # additional number of allowed LP iterations
0.29/0.37 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.37 c heuristics/veclendiving/maxlpiterofs = c 1500
0.29/0.37 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.37 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.29/0.37 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.37 c heuristics/veclendiving/freq = c -1
0.29/0.37 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.37 c heuristics/simplerounding/freq = c -1
0.29/0.37 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.37 c heuristics/shifting/freq = c -1
0.29/0.37 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.37 c heuristics/rounding/freq = c -1
0.29/0.37 c # additional number of allowed LP iterations
0.29/0.37 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.37 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.29/0.37 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.37 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.29/0.37 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.37 c heuristics/rootsoldiving/freq = c -1
0.29/0.37 c # number of nodes added to the contingent of the total nodes
0.29/0.37 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.37 c heuristics/rens/nodesofs = c 2000
0.29/0.37 c # minimum percentage of integer variables that have to be fixable
0.29/0.37 c # [type: real, range: [0,1], default: 0.5]
0.29/0.37 c heuristics/rens/minfixingrate = c 0.3
0.29/0.37 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.37 c heuristics/rens/freq = c -1
0.29/0.37 c # additional number of allowed LP iterations
0.29/0.37 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.37 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.29/0.37 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.37 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.29/0.37 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.37 c heuristics/pscostdiving/freq = c -1
0.29/0.37 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.37 c heuristics/oneopt/freq = c -1
0.29/0.37 c # additional number of allowed LP iterations
0.29/0.37 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.37 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.29/0.37 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.37 c # [type: real, range: [0,1], default: 0.01]
0.29/0.37 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.29/0.37 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.37 c heuristics/objpscostdiving/freq = c -1
0.29/0.37 c # additional number of allowed LP iterations
0.29/0.37 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.37 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.29/0.37 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.37 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.29/0.37 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.37 c heuristics/linesearchdiving/freq = c -1
0.29/0.37 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.37 c heuristics/intshifting/freq = c -1
0.29/0.37 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.37 c heuristics/intdiving/maxlpiterquot = c 0.075
0.29/0.37 c # additional number of allowed LP iterations
0.29/0.37 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.37 c heuristics/guideddiving/maxlpiterofs = c 1500
0.29/0.37 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.37 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.29/0.37 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.37 c heuristics/guideddiving/freq = c -1
0.29/0.37 c # additional number of allowed LP iterations
0.29/0.37 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.37 c heuristics/fracdiving/maxlpiterofs = c 1500
0.29/0.37 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.37 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.29/0.37 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.37 c heuristics/fracdiving/freq = c -1
0.29/0.37 c # additional number of allowed LP iterations
0.29/0.37 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.37 c heuristics/feaspump/maxlpiterofs = c 2000
0.29/0.37 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.37 c heuristics/feaspump/freq = c -1
0.29/0.37 c # minimum percentage of integer variables that have to be fixed
0.29/0.37 c # [type: real, range: [0,1], default: 0.666]
0.29/0.37 c heuristics/crossover/minfixingrate = c 0.5
0.29/0.37 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.37 c # [type: real, range: [0,1], default: 0.1]
0.29/0.37 c heuristics/crossover/nodesquot = c 0.15
0.29/0.37 c # number of nodes without incumbent change that heuristic should wait
0.29/0.37 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.37 c heuristics/crossover/nwaitingnodes = c 100
0.29/0.37 c # number of nodes added to the contingent of the total nodes
0.29/0.37 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.37 c heuristics/crossover/nodesofs = c 750
0.29/0.37 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.37 c heuristics/crossover/freq = c -1
0.29/0.37 c # additional number of allowed LP iterations
0.29/0.37 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.37 c heuristics/coefdiving/maxlpiterofs = c 1500
0.29/0.37 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.37 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.29/0.37 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.37 c heuristics/coefdiving/freq = c -1
0.29/0.37 c # priority of node selection rule <dfs> in standard mode
0.29/0.37 c # [type: int, range: [-536870912,536870911], default: 0]
0.29/0.37 c nodeselection/dfs/stdpriority = c 1000000
0.29/0.37 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.37 c presolving/probing/maxrounds = c 0
0.29/0.37 c # should presolving try to simplify knapsacks
0.29/0.37 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.37 c constraints/knapsack/simplifyinequalities = c TRUE
0.29/0.37 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.37 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.37 c constraints/knapsack/disaggregation = c FALSE
0.29/0.37 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.37 c constraints/knapsack/maxnumcardlift = c 0
0.29/0.37 c # should presolving try to simplify inequalities
0.29/0.37 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.37 c constraints/linear/simplifyinequalities = c TRUE
0.29/0.37 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.37 c separating/maxroundsroot = c 5
0.29/0.37 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.37 c separating/maxrounds = c 1
0.29/0.37 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.29/0.37 c # [type: char, range: {lafpsqd}, default: l]
0.29/0.37 c lp/pricing = c a
0.29/0.37 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.37 c lp/solvefreq = c 0
0.29/0.37 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.37 c limits/solutions = c 1
0.29/0.37 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.37 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.37 c limits/memory = c 1620
0.29/0.37 c # maximal time in seconds to run
0.29/0.37 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.37 c limits/time = c 1791
0.29/0.37 c # frequency for displaying node information lines
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.37 c display/freq = c 10000
0.29/0.37 c # should enforcement of pseudo solution be disabled?
0.29/0.37 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.37 c constraints/disableenfops = c TRUE
0.29/0.37 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.37 c constraints/agelimit = c 1
0.29/0.37 c # should binary conflicts be preferred?
0.29/0.37 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.37 c conflict/preferbinary = c TRUE
0.29/0.37 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.29/0.37 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.37 c conflict/interconss = c 0
0.29/0.37 c -----------------------------------------------------------------------------------------------
0.29/0.37 c start solving problem
0.29/0.37 c
0.59/0.66 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.59/0.66 c 0.5s| 1 | 0 | 754 | 13M| 0 | 18 |1700 |7023 |7023 |1700 |7023 | 0 | 0 | 0 | 3.220000e+02 | -- | Inf
0.89/0.90 c 0.7s| 1 | 0 | 923 | 13M| 0 | 21 |1700 |7023 |7023 |1700 |7025 | 2 | 0 | 0 | 3.235000e+02 | -- | Inf
1.00/1.01 c 0.8s| 1 | 0 | 1003 | 13M| 0 | 23 |1700 |7023 |7023 |1700 |7028 | 5 | 0 | 0 | 3.245000e+02 | -- | Inf
1.29/1.37 c 1.1s| 1 | 0 | 1229 | 13M| 0 | 27 |1700 |7023 |7023 |1700 |7031 | 8 | 0 | 0 | 3.256667e+02 | -- | Inf
1.49/1.56 c 1.3s| 1 | 0 | 1356 | 14M| 0 | 30 |1700 |7023 |7023 |1700 |7035 | 12 | 0 | 0 | 3.271667e+02 | -- | Inf
1.69/1.76 c 1.5s| 1 | 0 | 1481 | 14M| 0 | 34 |1700 |7023 |7023 |1700 |7042 | 19 | 0 | 0 | 3.282273e+02 | -- | Inf
21.68/21.76 c 21.5s| 1 | 2 | 1481 | 14M| 0 | 34 |1700 |7023 |7023 |1700 |7042 | 19 | 0 | 29 | 3.282273e+02 | -- | Inf
51.68/51.79 c 51.2s| 10000 | 5 | 1481 | 15M| 456 | - |1700 |7081 |1959 | 0 | 0 | 19 |5486 | 29 | 3.287273e+02 | -- | Inf
88.87/88.95 c 88.1s| 20000 | 9 | 1481 | 15M| 456 | - |1700 |7078 |1399 | 0 | 0 | 19 | 10k| 29 | 3.287273e+02 | -- | Inf
110.86/110.92 c
110.86/110.92 c SCIP Status : problem is solved [infeasible]
110.86/110.92 c Solving Time (sec) : 109.95
110.86/110.92 c Solving Nodes : 26396
110.86/110.92 c Primal Bound : +1.00000000000000e+20 (0 solutions)
110.86/110.92 c Dual Bound : +1.00000000000000e+20
110.86/110.92 c Gap : 0.00 %
110.86/110.92 c NODE 26396
110.86/110.92 c DUAL BOUND 1e+20
110.86/110.92 c PRIMAL BOUND 1e+20
110.86/110.92 c GAP 0
110.86/110.92 s UNSATISFIABLE
110.86/110.92 c SCIP Status : problem is solved [infeasible]
110.86/110.92 c Solving Time : 109.95
110.86/110.92 c Original Problem :
110.86/110.92 c Problem name : HOME/instance-1884367-1245257552.opb
110.86/110.92 c Variables : 2306 (2306 binary, 0 integer, 0 implicit integer, 0 continuous)
110.86/110.92 c Constraints : 8931 initial, 8931 maximal
110.86/110.92 c Presolved Problem :
110.86/110.92 c Problem name : t_HOME/instance-1884367-1245257552.opb
110.86/110.92 c Variables : 1700 (1700 binary, 0 integer, 0 implicit integer, 0 continuous)
110.86/110.92 c Constraints : 7023 initial, 7118 maximal
110.86/110.92 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
110.86/110.92 c trivial : 0.00 0 0 0 0 0 0 0 0
110.86/110.92 c dualfix : 0.00 0 0 0 0 0 0 0 0
110.86/110.92 c boundshift : 0.00 0 0 0 0 0 0 0 0
110.86/110.92 c inttobinary : 0.00 0 0 0 0 0 0 0 0
110.86/110.92 c implics : 0.01 0 234 0 0 0 0 0 0
110.86/110.92 c probing : 0.00 0 0 0 0 0 0 0 0
110.86/110.92 c linear : 0.11 336 36 0 336 0 1908 630 1008
110.86/110.92 c logicor : 0.03 0 0 0 0 0 0 0 0
110.86/110.92 c root node : - 1372 - - 1372 - - - -
110.86/110.92 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
110.86/110.92 c integral : 0 0 0 1 0 0 0 0 0 2
110.86/110.92 c logicor : 7023+ 5 143318 0 0 15745 6972031 0 0 0
110.86/110.92 c countsols : 0 0 0 0 0 0 0 0 0 0
110.86/110.92 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
110.86/110.92 c integral : 19.95 0.00 0.00 19.95 0.00
110.86/110.92 c logicor : 40.79 0.01 40.78 0.00 0.00
110.86/110.92 c countsols : 0.00 0.00 0.00 0.00 0.00
110.86/110.92 c Propagators : Time Calls Cutoffs DomReds
110.86/110.92 c rootredcost : 0.10 0 0 0
110.86/110.92 c pseudoobj : 14.24 154715 0 0
110.86/110.92 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
110.86/110.92 c propagation : 5.16 15745 13526 13526 9.5 1381 5.4 -
110.86/110.92 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
110.86/110.92 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
110.86/110.92 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
110.86/110.92 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
110.86/110.92 c applied globally : - - - 14907 9.1 - - -
110.86/110.92 c applied locally : - - - 0 0.0 - - -
110.86/110.92 c Separators : Time Calls Cutoffs DomReds Cuts Conss
110.86/110.92 c cut pool : 0.00 4 - - 7 - (maximal pool size: 79)
110.86/110.92 c redcost : 0.00 5 0 0 0 0
110.86/110.92 c impliedbounds : 0.00 5 0 0 0 0
110.86/110.92 c intobj : 0.00 0 0 0 0 0
110.86/110.92 c gomory : 0.05 5 0 0 249 0
110.86/110.92 c strongcg : 0.06 5 0 0 249 0
110.86/110.92 c cmir : 0.00 0 0 0 0 0
110.86/110.92 c flowcover : 0.00 0 0 0 0 0
110.86/110.92 c clique : 0.00 1 0 0 0 0
110.86/110.92 c zerohalf : 0.00 0 0 0 0 0
110.86/110.92 c mcf : 0.01 1 0 0 0 0
110.86/110.92 c Pricers : Time Calls Vars
110.86/110.92 c problem variables: 0.00 0 0
110.86/110.92 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
110.86/110.92 c relpscost : 19.95 1 0 0 0 0 2
110.86/110.92 c pscost : 0.00 0 0 0 0 0 0
110.86/110.92 c inference : 4.96 17660 0 0 0 0 35320
110.86/110.92 c mostinf : 0.00 0 0 0 0 0 0
110.86/110.92 c leastinf : 0.00 0 0 0 0 0 0
110.86/110.92 c fullstrong : 0.00 0 0 0 0 0 0
110.86/110.92 c allfullstrong : 0.00 0 0 0 0 0 0
110.86/110.92 c random : 0.00 0 0 0 0 0 0
110.86/110.92 c Primal Heuristics : Time Calls Found
110.86/110.92 c LP solutions : 0.00 - 0
110.86/110.92 c pseudo solutions : 0.00 - 0
110.86/110.92 c simplerounding : 0.00 0 0
110.86/110.92 c rounding : 0.00 0 0
110.86/110.92 c shifting : 0.00 0 0
110.86/110.92 c intshifting : 0.00 0 0
110.86/110.92 c oneopt : 0.00 0 0
110.86/110.92 c fixandinfer : 0.00 0 0
110.86/110.92 c feaspump : 0.00 0 0
110.86/110.92 c coefdiving : 0.00 0 0
110.86/110.92 c pscostdiving : 0.00 0 0
110.86/110.92 c fracdiving : 0.00 0 0
110.86/110.92 c veclendiving : 0.00 0 0
110.86/110.92 c intdiving : 0.00 0 0
110.86/110.92 c actconsdiving : 0.00 0 0
110.86/110.92 c objpscostdiving : 0.00 0 0
110.86/110.92 c rootsoldiving : 0.00 0 0
110.86/110.92 c linesearchdiving : 0.00 0 0
110.86/110.92 c guideddiving : 0.00 0 0
110.86/110.92 c octane : 0.00 0 0
110.86/110.92 c rens : 0.00 0 0
110.86/110.92 c rins : 0.00 0 0
110.86/110.92 c localbranching : 0.00 0 0
110.86/110.92 c mutation : 0.00 0 0
110.86/110.92 c crossover : 0.00 0 0
110.86/110.92 c dins : 0.00 0 0
110.86/110.92 c LP : Time Calls Iterations Iter/call Iter/sec
110.86/110.92 c primal LP : 0.00 0 0 0.00 -
110.86/110.92 c dual LP : 1.15 6 1481 246.83 1287.83
110.86/110.92 c barrier LP : 0.00 0 0 0.00 -
110.86/110.92 c diving/probing LP: 0.00 0 0 0.00 -
110.86/110.92 c strong branching : 19.95 29 19220 662.76 963.41
110.86/110.92 c (at root node) : - 29 19220 662.76 -
110.86/110.92 c conflict analysis: 0.00 0 0 0.00 -
110.86/110.92 c B&B Tree :
110.86/110.92 c number of runs : 1
110.86/110.92 c nodes : 26396
110.86/110.92 c nodes (total) : 26396
110.86/110.92 c nodes left : 0
110.86/110.92 c max depth : 456
110.86/110.92 c max depth (total): 456
110.86/110.92 c backtracks : 8054 (30.5%)
110.86/110.92 c delayed cutoffs : 8927
110.86/110.92 c repropagations : 18547 (2896102 domain reductions, 7010 cutoffs)
110.86/110.92 c avg switch length: 2.44
110.86/110.92 c switching time : 22.37
110.86/110.92 c Solution :
110.86/110.92 c Solutions found : 0 (0 improvements)
110.86/110.92 c Primal Bound : infeasible
110.86/110.92 c Dual Bound : -
110.86/110.92 c Gap : 0.00 %
110.86/110.92 c Root Dual Bound : +3.28227272727273e+02
110.86/110.97 c Time complete: 110.93.