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-1870642-1245214708.opb>
0.00/0.04 c original problem has 3262 variables (3262 bin, 0 int, 0 impl, 0 cont) and 3364 constraints
0.04/0.07 c No objective function, only one solution is needed.
0.04/0.07 c start presolving problem
0.04/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, 24696 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 24696 implications, 200 cliques
0.29/0.36 c presolved problem has 3262 variables (3262 bin, 0 int, 0 impl, 0 cont) and 3364 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 3062 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.14
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.53 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.53 c 0.3s| 1 | 0 | 322 | 14M| 0 | 160 |3262 |3364 |3364 |3262 |6426 | 0 | 0 | 0 | 8.000000e+01 | -- | Inf
0.89/0.97 c 0.7s| 1 | 0 | 346 | 14M| 0 | 161 |3262 |3364 |3364 |3262 |6428 | 2 | 0 | 0 | 8.000000e+01 | -- | Inf
2.18/2.25 c 2.0s| 1 | 0 | 458 | 14M| 0 | 161 |3262 |3364 |3364 |3262 |6429 | 3 | 0 | 0 | 8.000000e+01 | -- | Inf
2.68/2.74 c 2.5s| 1 | 0 | 569 | 14M| 0 | 163 |3262 |3364 |3364 |3262 |6431 | 5 | 0 | 0 | 8.000000e+01 | -- | Inf
4.39/4.43 c 4.2s| 1 | 0 | 600 | 14M| 0 | 164 |3262 |3364 |3364 |3262 |6433 | 7 | 0 | 0 | 8.000000e+01 | -- | Inf
6.49/6.57 c 6.3s| 1 | 0 | 769 | 14M| 0 | 162 |3262 |3364 |3364 |3262 |6434 | 8 | 0 | 0 | 8.000000e+01 | -- | Inf
21.68/21.79 c 21.5s| 1 | 2 | 769 | 14M| 0 | 162 |3262 |3364 |3364 |3262 |6434 | 8 | 0 | 21 | 8.000000e+01 | -- | Inf
120.83/120.96 c [src/scip/lpi_spx.cpp:265] Warning: SoPlex threw an exception: XSOLVE21 Basis is singular (numerical troubles, delta = 1e-06)
249.57/249.74 c
249.57/249.74 c SCIP Status : problem is solved [infeasible]
249.57/249.74 c Solving Time (sec) : 247.83
249.57/249.74 c Solving Nodes : 1134
249.57/249.74 c Primal Bound : +1.00000000000000e+20 (0 solutions)
249.57/249.74 c Dual Bound : +1.00000000000000e+20
249.57/249.74 c Gap : 0.00 %
249.57/249.74 c NODE 1134
249.57/249.74 c DUAL BOUND 1e+20
249.57/249.74 c PRIMAL BOUND 1e+20
249.57/249.74 c GAP 0
249.57/249.74 s UNSATISFIABLE
249.57/249.74 c SCIP Status : problem is solved [infeasible]
249.57/249.74 c Solving Time : 247.83
249.57/249.74 c Original Problem :
249.57/249.74 c Problem name : HOME/instance-1870642-1245214708.opb
249.57/249.74 c Variables : 3262 (3262 binary, 0 integer, 0 implicit integer, 0 continuous)
249.57/249.74 c Constraints : 3364 initial, 3364 maximal
249.57/249.74 c Presolved Problem :
249.57/249.74 c Problem name : t_HOME/instance-1870642-1245214708.opb
249.57/249.74 c Variables : 3262 (3262 binary, 0 integer, 0 implicit integer, 0 continuous)
249.57/249.74 c Constraints : 3364 initial, 3777 maximal
249.57/249.74 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
249.57/249.74 c trivial : 0.00 0 0 0 0 0 0 0 0
249.57/249.74 c dualfix : 0.00 0 0 0 0 0 0 0 0
249.57/249.74 c boundshift : 0.00 0 0 0 0 0 0 0 0
249.57/249.74 c inttobinary : 0.00 0 0 0 0 0 0 0 0
249.57/249.74 c implics : 0.01 0 0 0 0 0 0 0 0
249.57/249.74 c probing : 0.00 0 0 0 0 0 0 0 0
249.57/249.74 c knapsack : 0.00 0 0 0 0 0 0 0 0
249.57/249.74 c setppc : 0.00 0 0 0 0 0 0 0 0
249.57/249.74 c and : 0.10 0 0 0 0 0 0 0 0
249.57/249.74 c linear : 0.02 0 0 0 0 0 0 0 0
249.57/249.74 c logicor : 0.00 0 0 0 0 0 0 0 0
249.57/249.74 c root node : - 40 - - 40 - - - -
249.57/249.74 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
249.57/249.74 c integral : 0 0 0 589 0 2 38 0 0 1146
249.57/249.74 c knapsack : 1 5 3866 3 0 0 0 0 0 0
249.57/249.74 c setppc : 200 5 3866 3 0 0 18724 0 0 0
249.57/249.74 c and : 3062 793 3866 3 0 13 467519 286296 0 0
249.57/249.74 c linear : 1 5 3853 0 0 0 0 0 0 0
249.57/249.74 c logicor : 100+ 5 1433 0 0 1 992 0 0 0
249.57/249.74 c countsols : 0 0 0 0 0 0 0 0 0 0
249.57/249.74 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
249.57/249.74 c integral : 105.70 0.00 0.00 105.70 0.00
249.57/249.74 c knapsack : 0.01 0.01 0.00 0.00 0.00
249.57/249.74 c setppc : 0.10 0.00 0.10 0.00 0.00
249.57/249.74 c and : 4.71 2.53 2.18 0.00 0.00
249.57/249.74 c linear : 0.07 0.00 0.07 0.00 0.00
249.57/249.74 c logicor : 0.07 0.00 0.07 0.00 0.00
249.57/249.74 c countsols : 0.00 0.00 0.00 0.00 0.00
249.57/249.74 c Propagators : Time Calls Cutoffs DomReds
249.57/249.74 c rootredcost : 0.00 0 0 0
249.57/249.74 c pseudoobj : 1.40 3895 1 0
249.57/249.74 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
249.57/249.74 c propagation : 0.00 14 14 17 3.8 0 0.0 -
249.57/249.74 c infeasible LP : 0.36 221 213 758 18.4 0 0.0 0
249.57/249.74 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
249.57/249.74 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
249.57/249.74 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
249.57/249.74 c applied globally : - - - 416 23.2 - - -
249.57/249.74 c applied locally : - - - 0 0.0 - - -
249.57/249.74 c Separators : Time Calls Cutoffs DomReds Cuts Conss
249.57/249.74 c cut pool : 0.00 4 - - 8 - (maximal pool size: 16)
249.57/249.74 c redcost : 0.27 793 0 0 0 0
249.57/249.74 c impliedbounds : 0.01 5 0 0 0 0
249.57/249.74 c intobj : 0.00 0 0 0 0 0
249.57/249.74 c gomory : 3.10 5 0 0 1000 0
249.57/249.74 c strongcg : 2.26 5 0 0 1500 0
249.57/249.74 c cmir : 0.00 0 0 0 0 0
249.57/249.74 c flowcover : 0.00 0 0 0 0 0
249.57/249.74 c clique : 0.02 5 0 0 0 0
249.57/249.74 c zerohalf : 0.00 0 0 0 0 0
249.57/249.74 c mcf : 0.04 2 0 0 0 0
249.57/249.74 c Pricers : Time Calls Vars
249.57/249.74 c problem variables: 0.00 0 0
249.57/249.74 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
249.57/249.74 c relpscost : 105.70 586 2 38 0 0 1146
249.57/249.74 c pscost : 0.00 0 0 0 0 0 0
249.57/249.74 c inference : 0.00 0 0 0 0 0 0
249.57/249.74 c mostinf : 0.00 0 0 0 0 0 0
249.57/249.74 c leastinf : 0.00 0 0 0 0 0 0
249.57/249.74 c fullstrong : 0.00 0 0 0 0 0 0
249.57/249.74 c allfullstrong : 0.00 0 0 0 0 0 0
249.57/249.74 c random : 0.00 0 0 0 0 0 0
249.57/249.74 c Primal Heuristics : Time Calls Found
249.57/249.74 c LP solutions : 0.00 - 0
249.57/249.74 c pseudo solutions : 0.00 - 0
249.57/249.74 c simplerounding : 0.00 0 0
249.57/249.74 c rounding : 0.00 0 0
249.57/249.74 c shifting : 0.00 0 0
249.57/249.74 c intshifting : 0.00 0 0
249.57/249.74 c oneopt : 0.00 0 0
249.57/249.74 c fixandinfer : 0.00 0 0
249.57/249.74 c feaspump : 0.00 0 0
249.57/249.74 c coefdiving : 0.00 0 0
249.57/249.74 c pscostdiving : 0.00 0 0
249.57/249.74 c fracdiving : 0.00 0 0
249.57/249.74 c veclendiving : 0.00 0 0
249.57/249.74 c intdiving : 0.00 0 0
249.57/249.74 c actconsdiving : 0.00 0 0
249.57/249.74 c objpscostdiving : 0.00 0 0
249.57/249.74 c rootsoldiving : 0.00 0 0
249.57/249.74 c linesearchdiving : 0.00 0 0
249.57/249.74 c guideddiving : 0.00 0 0
249.57/249.74 c octane : 0.00 0 0
249.57/249.74 c rens : 0.00 0 0
249.57/249.74 c rins : 0.00 0 0
249.57/249.74 c localbranching : 0.00 0 0
249.57/249.74 c mutation : 0.00 0 0
249.57/249.74 c crossover : 0.00 0 0
249.57/249.74 c dins : 0.00 0 0
249.57/249.74 c LP : Time Calls Iterations Iter/call Iter/sec
249.57/249.74 c primal LP : 0.76 0 0 0.00 0.00
249.57/249.74 c dual LP : 121.51 1909 320223 167.74 2635.36
249.57/249.74 c barrier LP : 0.00 0 0 0.00 -
249.57/249.74 c diving/probing LP: 0.00 0 0 0.00 -
249.57/249.74 c strong branching : 105.57 3689 268789 72.86 2546.07
249.57/249.74 c (at root node) : - 21 13308 633.71 -
249.57/249.74 c conflict analysis: 0.00 0 0 0.00 -
249.57/249.74 c B&B Tree :
249.57/249.74 c number of runs : 1
249.57/249.74 c nodes : 1134
249.57/249.74 c nodes (total) : 1134
249.57/249.74 c nodes left : 0
249.57/249.74 c max depth : 67
249.57/249.74 c max depth (total): 67
249.57/249.74 c backtracks : 235 (20.7%)
249.57/249.74 c delayed cutoffs : 13
249.57/249.74 c repropagations : 843 (11099 domain reductions, 0 cutoffs)
249.57/249.74 c avg switch length: 5.35
249.57/249.74 c switching time : 2.28
249.57/249.74 c Solution :
249.57/249.74 c Solutions found : 0 (0 improvements)
249.57/249.74 c Primal Bound : infeasible
249.57/249.74 c Dual Bound : -
249.57/249.74 c Gap : 0.00 %
249.57/249.74 c Root Dual Bound : +8.00000000000002e+01
249.57/249.79 c Time complete: 249.67.