0.00/0.04 c SCIP version 1.1.0.7
0.00/0.04 c LP-Solver SoPlex 1.4.1
0.00/0.04 c user parameter file <scip.set> not found - using default parameters
0.00/0.04 c read problem <HOME/instance-1870590-1245213056.opb>
0.00/0.04 c original problem has 3238 variables (3238 bin, 0 int, 0 impl, 0 cont) and 3340 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.19/0.23 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 301 upgd conss, 24504 impls, 200 clqs
0.29/0.36 c presolving (2 rounds):
0.29/0.36 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.36 c 24504 implications, 200 cliques
0.29/0.36 c presolved problem has 3238 variables (3238 bin, 0 int, 0 impl, 0 cont) and 3340 constraints
0.29/0.36 c 1 constraints of type <knapsack>
0.29/0.36 c 200 constraints of type <setppc>
0.29/0.36 c 3038 constraints of type <and>
0.29/0.36 c 1 constraints of type <linear>
0.29/0.36 c 100 constraints of type <logicor>
0.29/0.36 c transformed objective value is always integral (scale: 1)
0.29/0.36 c Presolving Time: 0.15
0.29/0.36 c SATUNSAT-NLC
0.29/0.36 c -----------------------------------------------------------------------------------------------
0.29/0.36 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.36 c separating/flowcover/freq = c -1
0.29/0.36 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.36 c separating/cmir/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/veclendiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.29/0.36 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/veclendiving/freq = c -1
0.29/0.36 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.36 c heuristics/simplerounding/freq = c -1
0.29/0.36 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/shifting/freq = c -1
0.29/0.36 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.36 c heuristics/rounding/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.36 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.29/0.36 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.36 c heuristics/rootsoldiving/freq = c -1
0.29/0.36 c # number of nodes added to the contingent of the total nodes
0.29/0.36 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.36 c heuristics/rens/nodesofs = c 2000
0.29/0.36 c # minimum percentage of integer variables that have to be fixable
0.29/0.36 c # [type: real, range: [0,1], default: 0.5]
0.29/0.36 c heuristics/rens/minfixingrate = c 0.3
0.29/0.36 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.36 c heuristics/rens/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.29/0.36 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/pscostdiving/freq = c -1
0.29/0.36 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.36 c heuristics/oneopt/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.36 c # [type: real, range: [0,1], default: 0.01]
0.29/0.36 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.29/0.36 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.36 c heuristics/objpscostdiving/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.29/0.36 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/linesearchdiving/freq = c -1
0.29/0.36 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/intshifting/freq = c -1
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/intdiving/maxlpiterquot = c 0.075
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/guideddiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.29/0.36 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/guideddiving/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/fracdiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.29/0.36 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/fracdiving/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/feaspump/maxlpiterofs = c 2000
0.29/0.36 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.36 c heuristics/feaspump/freq = c -1
0.29/0.36 c # minimum percentage of integer variables that have to be fixed
0.29/0.36 c # [type: real, range: [0,1], default: 0.666]
0.29/0.36 c heuristics/crossover/minfixingrate = c 0.5
0.29/0.36 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.36 c # [type: real, range: [0,1], default: 0.1]
0.29/0.36 c heuristics/crossover/nodesquot = c 0.15
0.29/0.36 c # number of nodes without incumbent change that heuristic should wait
0.29/0.36 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.36 c heuristics/crossover/nwaitingnodes = c 100
0.29/0.36 c # number of nodes added to the contingent of the total nodes
0.29/0.36 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.36 c heuristics/crossover/nodesofs = c 750
0.29/0.36 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.36 c heuristics/crossover/freq = c -1
0.29/0.36 c # additional number of allowed LP iterations
0.29/0.36 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.36 c heuristics/coefdiving/maxlpiterofs = c 1500
0.29/0.36 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.36 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.29/0.36 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.36 c heuristics/coefdiving/freq = c -1
0.29/0.36 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.36 c presolving/probing/maxrounds = c 0
0.29/0.36 c # should presolving try to simplify knapsacks
0.29/0.36 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.36 c constraints/knapsack/simplifyinequalities = c TRUE
0.29/0.36 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.36 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.36 c constraints/knapsack/disaggregation = c FALSE
0.29/0.36 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.36 c constraints/knapsack/maxnumcardlift = c 0
0.29/0.36 c # should presolving try to simplify inequalities
0.29/0.36 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.36 c constraints/linear/simplifyinequalities = c TRUE
0.29/0.36 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.36 c separating/maxroundsroot = c 5
0.29/0.36 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.36 c separating/maxrounds = c 1
0.29/0.36 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.36 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.36 c limits/solutions = c 1
0.29/0.36 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.36 c limits/memory = c 1620
0.29/0.36 c # maximal time in seconds to run
0.29/0.36 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.36 c limits/time = c 1791
0.29/0.36 c # frequency for displaying node information lines
0.29/0.36 c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.36 c display/freq = c 10000
0.29/0.36 c -----------------------------------------------------------------------------------------------
0.29/0.36 c start solving problem
0.29/0.36 c
0.49/0.54 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.54 c 0.3s| 1 | 0 | 327 | 14M| 0 | 160 |3238 |3340 |3340 |3238 |6378 | 0 | 0 | 0 | 8.000000e+01 | -- | Inf
0.89/0.95 c 0.7s| 1 | 0 | 361 | 14M| 0 | 160 |3238 |3340 |3340 |3238 |6379 | 1 | 0 | 0 | 8.000000e+01 | -- | Inf
1.39/1.43 c 1.2s| 1 | 0 | 473 | 14M| 0 | 163 |3238 |3340 |3340 |3238 |6381 | 3 | 0 | 0 | 8.000000e+01 | -- | Inf
2.98/3.04 c 2.8s| 1 | 0 | 476 | 14M| 0 | 162 |3238 |3340 |3340 |3238 |6382 | 4 | 0 | 0 | 8.000000e+01 | -- | Inf
4.68/4.71 c 4.4s| 1 | 0 | 614 | 14M| 0 | 163 |3238 |3340 |3340 |3238 |6383 | 5 | 0 | 0 | 8.000000e+01 | -- | Inf
6.78/6.86 c 6.6s| 1 | 0 | 718 | 14M| 0 | 164 |3238 |3340 |3340 |3238 |6384 | 6 | 0 | 0 | 8.000000e+01 | -- | Inf
15.98/16.05 c 15.7s| 1 | 2 | 718 | 14M| 0 | 164 |3238 |3340 |3340 |3238 |6384 | 6 | 0 | 17 | 8.000000e+01 | -- | Inf
67.06/67.18 c [src/scip/lpi_spx.cpp:265] Warning: SoPlex threw an exception: XSOLVE21 Basis is singular (numerical troubles, delta = 1e-06)
67.06/67.18 c [src/scip/lpi_spx.cpp:1854] ERROR: SCIPlpiStrongbranch() returned SoPlex status -4
67.06/67.18 c (node 160) error in strong branching call for variable <t_andresultant1967> with solution 0.291058
201.33/201.47 c
201.33/201.47 c SCIP Status : problem is solved [infeasible]
201.33/201.47 c Solving Time (sec) : 199.91
201.33/201.47 c Solving Nodes : 901
201.33/201.47 c Primal Bound : +1.00000000000000e+20 (0 solutions)
201.33/201.47 c Dual Bound : +1.00000000000000e+20
201.33/201.47 c Gap : 0.00 %
201.33/201.47 c NODE 901
201.33/201.47 c DUAL BOUND 1e+20
201.33/201.47 c PRIMAL BOUND 1e+20
201.33/201.47 c GAP 0
201.33/201.47 s UNSATISFIABLE
201.33/201.47 c SCIP Status : problem is solved [infeasible]
201.33/201.47 c Solving Time : 199.91
201.33/201.47 c Original Problem :
201.33/201.47 c Problem name : HOME/instance-1870590-1245213056.opb
201.33/201.47 c Variables : 3238 (3238 binary, 0 integer, 0 implicit integer, 0 continuous)
201.33/201.47 c Constraints : 3340 initial, 3340 maximal
201.33/201.47 c Presolved Problem :
201.33/201.47 c Problem name : t_HOME/instance-1870590-1245213056.opb
201.33/201.47 c Variables : 3238 (3238 binary, 0 integer, 0 implicit integer, 0 continuous)
201.33/201.47 c Constraints : 3340 initial, 3588 maximal
201.33/201.47 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
201.33/201.47 c trivial : 0.00 0 0 0 0 0 0 0 0
201.33/201.47 c dualfix : 0.00 0 0 0 0 0 0 0 0
201.33/201.47 c boundshift : 0.00 0 0 0 0 0 0 0 0
201.33/201.47 c inttobinary : 0.00 0 0 0 0 0 0 0 0
201.33/201.47 c implics : 0.01 0 0 0 0 0 0 0 0
201.33/201.47 c probing : 0.00 0 0 0 0 0 0 0 0
201.33/201.47 c knapsack : 0.01 0 0 0 0 0 0 0 0
201.33/201.47 c setppc : 0.00 0 0 0 0 0 0 0 0
201.33/201.47 c and : 0.10 0 0 0 0 0 0 0 0
201.33/201.47 c linear : 0.02 0 0 0 0 0 0 0 0
201.33/201.47 c logicor : 0.00 0 0 0 0 0 0 0 0
201.33/201.47 c root node : - 71 - - 71 - - - -
201.33/201.47 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
201.33/201.47 c integral : 0 0 0 484 0 10 27 0 0 924
201.33/201.47 c knapsack : 1 5 3008 1 0 0 0 0 0 0
201.33/201.47 c setppc : 200 5 3008 1 0 0 12832 0 0 0
201.33/201.47 c and : 3038 665 3008 1 0 12 314552 253677 0 0
201.33/201.47 c linear : 1 5 2996 0 0 0 0 0 0 0
201.33/201.47 c logicor : 100+ 5 1082 0 0 2 769 0 0 0
201.33/201.47 c countsols : 0 0 0 0 0 0 0 0 0 0
201.33/201.47 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
201.33/201.47 c integral : 85.75 0.00 0.00 85.75 0.00
201.33/201.47 c knapsack : 0.00 0.00 0.00 0.00 0.00
201.33/201.47 c setppc : 0.07 0.00 0.07 0.00 0.00
201.33/201.47 c and : 3.22 1.96 1.25 0.01 0.00
201.33/201.47 c linear : 0.01 0.00 0.01 0.00 0.00
201.33/201.47 c logicor : 0.03 0.00 0.03 0.00 0.00
201.33/201.47 c countsols : 0.00 0.00 0.00 0.00 0.00
201.33/201.47 c Propagators : Time Calls Cutoffs DomReds
201.33/201.47 c rootredcost : 0.00 0 0 0
201.33/201.47 c pseudoobj : 1.36 3026 1 0
201.33/201.47 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
201.33/201.47 c propagation : 0.00 14 14 14 4.2 0 0.0 -
201.33/201.47 c infeasible LP : 0.37 175 166 566 17.4 0 0.0 0
201.33/201.47 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
201.33/201.47 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
201.33/201.47 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
201.33/201.47 c applied globally : - - - 292 22.3 - - -
201.33/201.47 c applied locally : - - - 0 0.0 - - -
201.33/201.47 c Separators : Time Calls Cutoffs DomReds Cuts Conss
201.33/201.47 c cut pool : 0.00 4 - - 1 - (maximal pool size: 18)
201.33/201.47 c redcost : 0.30 665 0 0 0 0
201.33/201.47 c impliedbounds : 0.00 5 0 0 0 0
201.33/201.47 c intobj : 0.00 0 0 0 0 0
201.33/201.47 c gomory : 3.32 5 0 0 1114 0
201.33/201.47 c strongcg : 2.40 5 0 0 1527 0
201.33/201.47 c cmir : 0.00 0 0 0 0 0
201.33/201.47 c flowcover : 0.00 0 0 0 0 0
201.33/201.47 c clique : 0.02 5 0 0 0 0
201.33/201.47 c zerohalf : 0.00 0 0 0 0 0
201.33/201.47 c mcf : 0.04 2 0 0 0 0
201.33/201.47 c Pricers : Time Calls Vars
201.33/201.47 c problem variables: 0.00 0 0
201.33/201.47 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
201.33/201.47 c relpscost : 85.75 483 10 27 0 0 924
201.33/201.47 c pscost : 0.00 0 0 0 0 0 0
201.33/201.47 c inference : 0.00 0 0 0 0 0 0
201.33/201.47 c mostinf : 0.00 0 0 0 0 0 0
201.33/201.47 c leastinf : 0.00 0 0 0 0 0 0
201.33/201.47 c fullstrong : 0.00 0 0 0 0 0 0
201.33/201.47 c allfullstrong : 0.00 0 0 0 0 0 0
201.33/201.47 c random : 0.00 0 0 0 0 0 0
201.33/201.47 c Primal Heuristics : Time Calls Found
201.33/201.47 c LP solutions : 0.00 - 0
201.33/201.47 c pseudo solutions : 0.00 - 0
201.33/201.47 c simplerounding : 0.00 0 0
201.33/201.47 c rounding : 0.00 0 0
201.33/201.47 c shifting : 0.00 0 0
201.33/201.47 c intshifting : 0.00 0 0
201.33/201.47 c oneopt : 0.00 0 0
201.33/201.47 c fixandinfer : 0.00 0 0
201.33/201.47 c feaspump : 0.00 0 0
201.33/201.47 c coefdiving : 0.00 0 0
201.33/201.47 c pscostdiving : 0.00 0 0
201.33/201.47 c fracdiving : 0.00 0 0
201.33/201.47 c veclendiving : 0.00 0 0
201.33/201.47 c intdiving : 0.00 0 0
201.33/201.47 c actconsdiving : 0.00 0 0
201.33/201.47 c objpscostdiving : 0.00 0 0
201.33/201.47 c rootsoldiving : 0.00 0 0
201.33/201.47 c linesearchdiving : 0.00 0 0
201.33/201.47 c guideddiving : 0.00 0 0
201.33/201.47 c octane : 0.00 0 0
201.33/201.47 c rens : 0.00 0 0
201.33/201.47 c rins : 0.00 0 0
201.33/201.47 c localbranching : 0.00 0 0
201.33/201.47 c mutation : 0.00 0 0
201.33/201.47 c crossover : 0.00 0 0
201.33/201.47 c dins : 0.00 0 0
201.33/201.47 c LP : Time Calls Iterations Iter/call Iter/sec
201.33/201.47 c primal LP : 0.64 0 0 0.00 0.00
201.33/201.47 c dual LP : 95.99 1542 256045 166.05 2667.41
201.33/201.47 c barrier LP : 0.00 0 0 0.00 -
201.33/201.47 c diving/probing LP: 0.00 0 0 0.00 -
201.33/201.47 c strong branching : 85.60 3350 231813 69.20 2708.10
201.33/201.47 c (at root node) : - 17 8292 487.76 -
201.33/201.47 c conflict analysis: 0.00 0 0 0.00 -
201.33/201.47 c B&B Tree :
201.33/201.47 c number of runs : 1
201.33/201.47 c nodes : 901
201.33/201.47 c nodes (total) : 901
201.33/201.47 c nodes left : 0
201.33/201.47 c max depth : 48
201.33/201.47 c max depth (total): 48
201.33/201.47 c backtracks : 212 (23.5%)
201.33/201.47 c delayed cutoffs : 24
201.33/201.47 c repropagations : 639 (11585 domain reductions, 1 cutoffs)
201.33/201.47 c avg switch length: 4.94
201.33/201.47 c switching time : 1.61
201.33/201.47 c Solution :
201.33/201.47 c Solutions found : 0 (0 improvements)
201.33/201.47 c Primal Bound : infeasible
201.33/201.47 c Dual Bound : -
201.33/201.47 c Gap : 0.00 %
201.33/201.47 c Root Dual Bound : +8.00000000000002e+01
201.43/201.52 c Time complete: 201.45.