0.03/0.04 c SCIP version 1.1.0.7
0.03/0.04 c LP-Solver Clp 1.8.2
0.03/0.04 c user parameter file <scip.set> not found - using default parameters
0.03/0.04 c read problem <HOME/instance-1870607-1245213450.opb>
0.03/0.04 c original problem has 3270 variables (3270 bin, 0 int, 0 impl, 0 cont) and 3372 constraints
0.03/0.07 c No objective function, only one solution is needed.
0.03/0.07 c start presolving problem
0.03/0.07 c presolving:
0.19/0.24 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 301 upgd conss, 24760 impls, 200 clqs
0.29/0.39 c presolving (2 rounds):
0.29/0.39 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.39 c 24760 implications, 200 cliques
0.29/0.39 c presolved problem has 3270 variables (3270 bin, 0 int, 0 impl, 0 cont) and 3372 constraints
0.29/0.39 c 1 constraints of type <knapsack>
0.29/0.39 c 200 constraints of type <setppc>
0.29/0.39 c 3070 constraints of type <and>
0.29/0.39 c 1 constraints of type <linear>
0.29/0.39 c 100 constraints of type <logicor>
0.29/0.39 c transformed objective value is always integral (scale: 1)
0.29/0.39 c Presolving Time: 0.16
0.29/0.39 c SATUNSAT-NLC
0.29/0.39 c -----------------------------------------------------------------------------------------------
0.29/0.39 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39 c separating/flowcover/freq = c -1
0.29/0.39 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39 c separating/cmir/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/veclendiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.29/0.39 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/veclendiving/freq = c -1
0.29/0.39 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/simplerounding/freq = c -1
0.29/0.39 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/shifting/freq = c -1
0.29/0.39 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/rounding/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.39 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.29/0.39 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.39 c heuristics/rootsoldiving/freq = c -1
0.29/0.39 c # number of nodes added to the contingent of the total nodes
0.29/0.39 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.39 c heuristics/rens/nodesofs = c 2000
0.29/0.39 c # minimum percentage of integer variables that have to be fixable
0.29/0.39 c # [type: real, range: [0,1], default: 0.5]
0.29/0.39 c heuristics/rens/minfixingrate = c 0.3
0.29/0.39 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39 c heuristics/rens/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.29/0.39 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/pscostdiving/freq = c -1
0.29/0.39 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/oneopt/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.39 c # [type: real, range: [0,1], default: 0.01]
0.29/0.39 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.29/0.39 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.39 c heuristics/objpscostdiving/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.29/0.39 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/linesearchdiving/freq = c -1
0.29/0.39 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/intshifting/freq = c -1
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/intdiving/maxlpiterquot = c 0.075
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/guideddiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.29/0.39 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/guideddiving/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/fracdiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.29/0.39 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/fracdiving/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/feaspump/maxlpiterofs = c 2000
0.29/0.39 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.39 c heuristics/feaspump/freq = c -1
0.29/0.39 c # minimum percentage of integer variables that have to be fixed
0.29/0.39 c # [type: real, range: [0,1], default: 0.666]
0.29/0.39 c heuristics/crossover/minfixingrate = c 0.5
0.29/0.39 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.39 c # [type: real, range: [0,1], default: 0.1]
0.29/0.39 c heuristics/crossover/nodesquot = c 0.15
0.29/0.39 c # number of nodes without incumbent change that heuristic should wait
0.29/0.39 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.39 c heuristics/crossover/nwaitingnodes = c 100
0.29/0.39 c # number of nodes added to the contingent of the total nodes
0.29/0.39 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.39 c heuristics/crossover/nodesofs = c 750
0.29/0.39 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.39 c heuristics/crossover/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/coefdiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.29/0.39 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/coefdiving/freq = c -1
0.29/0.39 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c presolving/probing/maxrounds = c 0
0.29/0.39 c # should presolving try to simplify knapsacks
0.29/0.39 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.39 c constraints/knapsack/simplifyinequalities = c TRUE
0.29/0.39 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.39 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.39 c constraints/knapsack/disaggregation = c FALSE
0.29/0.39 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c constraints/knapsack/maxnumcardlift = c 0
0.29/0.39 c # should presolving try to simplify inequalities
0.29/0.39 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.39 c constraints/linear/simplifyinequalities = c TRUE
0.29/0.39 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c separating/maxroundsroot = c 5
0.29/0.39 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.39 c separating/maxrounds = c 1
0.29/0.39 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c limits/solutions = c 1
0.29/0.39 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.39 c limits/memory = c 1620
0.29/0.39 c # maximal time in seconds to run
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.39 c limits/time = c 1791
0.29/0.39 c # frequency for displaying node information lines
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.39 c display/freq = c 10000
0.29/0.39 c -----------------------------------------------------------------------------------------------
0.29/0.39 c start solving problem
0.29/0.39 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 | 177 | 14M| 0 | 160 |3270 |3372 |3372 |3270 |6442 | 0 | 0 | 0 | 8.000000e+01 | -- | Inf
0.99/1.05 c 0.8s| 1 | 0 | 252 | 14M| 0 | 160 |3270 |3372 |3372 |3270 |6444 | 2 | 0 | 0 | 8.000000e+01 | -- | Inf
2.40/2.47 c 2.2s| 1 | 0 | 386 | 14M| 0 | 161 |3270 |3372 |3372 |3270 |6445 | 3 | 0 | 0 | 8.000000e+01 | -- | Inf
3.09/3.18 c 2.9s| 1 | 0 | 524 | 14M| 0 | 163 |3270 |3372 |3372 |3270 |6447 | 5 | 0 | 0 | 8.000000e+01 | -- | Inf
4.89/4.97 c 4.7s| 1 | 0 | 535 | 14M| 0 | 164 |3270 |3372 |3372 |3270 |6448 | 6 | 0 | 0 | 8.000000e+01 | -- | Inf
6.89/6.99 c 6.7s| 1 | 0 | 583 | 14M| 0 | 165 |3270 |3372 |3372 |3270 |6449 | 7 | 0 | 0 | 8.000000e+01 | -- | Inf
16.08/16.18 c 15.9s| 1 | 2 | 583 | 14M| 0 | 165 |3270 |3372 |3372 |3270 |6449 | 7 | 0 | 33 | 8.000000e+01 | -- | Inf
254.79/254.98 c
254.79/254.98 c SCIP Status : problem is solved [infeasible]
254.79/254.98 c Solving Time (sec) : 254.02
254.79/254.98 c Solving Nodes : 1149
254.79/254.98 c Primal Bound : +1.00000000000000e+20 (0 solutions)
254.79/254.98 c Dual Bound : +1.00000000000000e+20
254.79/254.98 c Gap : 0.00 %
254.79/254.98 c NODE 1149
254.79/254.98 c DUAL BOUND 1e+20
254.79/254.98 c PRIMAL BOUND 1e+20
254.79/254.98 c GAP 0
254.79/254.98 s UNSATISFIABLE
254.79/254.98 c SCIP Status : problem is solved [infeasible]
254.79/254.98 c Solving Time : 254.02
254.79/254.98 c Original Problem :
254.79/254.98 c Problem name : HOME/instance-1870607-1245213450.opb
254.79/254.98 c Variables : 3270 (3270 binary, 0 integer, 0 implicit integer, 0 continuous)
254.79/254.98 c Constraints : 3372 initial, 3372 maximal
254.79/254.98 c Presolved Problem :
254.79/254.98 c Problem name : t_HOME/instance-1870607-1245213450.opb
254.79/254.98 c Variables : 3270 (3270 binary, 0 integer, 0 implicit integer, 0 continuous)
254.79/254.98 c Constraints : 3372 initial, 3390 maximal
254.79/254.98 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
254.79/254.98 c trivial : 0.00 0 0 0 0 0 0 0 0
254.79/254.98 c dualfix : 0.00 0 0 0 0 0 0 0 0
254.79/254.98 c boundshift : 0.00 0 0 0 0 0 0 0 0
254.79/254.98 c inttobinary : 0.00 0 0 0 0 0 0 0 0
254.79/254.98 c implics : 0.01 0 0 0 0 0 0 0 0
254.79/254.98 c probing : 0.00 0 0 0 0 0 0 0 0
254.79/254.98 c knapsack : 0.00 0 0 0 0 0 0 0 0
254.79/254.98 c setppc : 0.00 0 0 0 0 0 0 0 0
254.79/254.98 c and : 0.11 0 0 0 0 0 0 0 0
254.79/254.98 c linear : 0.02 0 0 0 0 0 0 0 0
254.79/254.98 c logicor : 0.00 0 0 0 0 0 0 0 0
254.79/254.98 c root node : - 99 - - 99 - - - -
254.79/254.98 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
254.79/254.98 c integral : 0 0 0 585 0 4 13 0 0 1148
254.79/254.98 c knapsack : 1 5 2899 2 0 0 0 0 0 0
254.79/254.98 c setppc : 200 5 2899 2 0 3 17834 0 0 0
254.79/254.98 c and : 3070 825 2896 2 0 16 434567 318585 0 0
254.79/254.98 c linear : 1 5 2880 0 0 0 0 0 0 0
254.79/254.98 c logicor : 100+ 5 948 0 0 0 835 0 0 0
254.79/254.98 c countsols : 0 0 0 0 0 0 0 0 0 0
254.79/254.98 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
254.79/254.98 c integral : 82.91 0.00 0.00 82.91 0.00
254.79/254.98 c knapsack : 0.00 0.00 0.00 0.00 0.00
254.79/254.98 c setppc : 0.11 0.00 0.11 0.00 0.00
254.79/254.98 c and : 4.67 2.58 2.09 0.00 0.00
254.79/254.98 c linear : 0.08 0.00 0.08 0.00 0.00
254.79/254.98 c logicor : 0.03 0.00 0.03 0.00 0.00
254.79/254.98 c countsols : 0.00 0.00 0.00 0.00 0.00
254.79/254.98 c Propagators : Time Calls Cutoffs DomReds
254.79/254.98 c rootredcost : 0.01 0 0 0
254.79/254.98 c pseudoobj : 1.21 2938 1 0
254.79/254.98 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
254.79/254.98 c propagation : 0.00 19 18 18 2.1 0 0.0 -
254.79/254.98 c infeasible LP : 0.53 551 0 0 0.0 0 0.0 0
254.79/254.98 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
254.79/254.98 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
254.79/254.98 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
254.79/254.98 c applied globally : - - - 18 2.1 - - -
254.79/254.98 c applied locally : - - - 0 0.0 - - -
254.79/254.98 c Separators : Time Calls Cutoffs DomReds Cuts Conss
254.79/254.98 c cut pool : 0.00 4 - - 3 - (maximal pool size: 17)
254.79/254.98 c redcost : 0.28 825 0 0 0 0
254.79/254.98 c impliedbounds : 0.01 5 0 0 0 0
254.79/254.98 c intobj : 0.00 0 0 0 0 0
254.79/254.98 c gomory : 3.38 5 0 0 1001 0
254.79/254.98 c strongcg : 2.42 5 0 0 1530 0
254.79/254.98 c cmir : 0.00 0 0 0 0 0
254.79/254.98 c flowcover : 0.00 0 0 0 0 0
254.79/254.98 c clique : 0.04 5 0 0 0 0
254.79/254.98 c zerohalf : 0.00 0 0 0 0 0
254.79/254.98 c mcf : 0.05 2 0 0 0 0
254.79/254.98 c Pricers : Time Calls Vars
254.79/254.98 c problem variables: 0.00 0 0
254.79/254.98 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
254.79/254.99 c relpscost : 82.91 583 4 13 0 0 1148
254.79/254.99 c pscost : 0.00 0 0 0 0 0 0
254.79/254.99 c inference : 0.00 0 0 0 0 0 0
254.79/254.99 c mostinf : 0.00 0 0 0 0 0 0
254.79/254.99 c leastinf : 0.00 0 0 0 0 0 0
254.79/254.99 c fullstrong : 0.00 0 0 0 0 0 0
254.79/254.99 c allfullstrong : 0.00 0 0 0 0 0 0
254.79/254.99 c random : 0.00 0 0 0 0 0 0
254.79/254.99 c Primal Heuristics : Time Calls Found
254.79/254.99 c LP solutions : 0.00 - 0
254.79/254.99 c pseudo solutions : 0.00 - 0
254.79/254.99 c simplerounding : 0.00 0 0
254.79/254.99 c rounding : 0.00 0 0
254.79/254.99 c shifting : 0.00 0 0
254.79/254.99 c intshifting : 0.00 0 0
254.79/254.99 c oneopt : 0.00 0 0
254.79/254.99 c fixandinfer : 0.00 0 0
254.79/254.99 c feaspump : 0.00 0 0
254.79/254.99 c coefdiving : 0.00 0 0
254.79/254.99 c pscostdiving : 0.00 0 0
254.79/254.99 c fracdiving : 0.00 0 0
254.79/254.99 c veclendiving : 0.00 0 0
254.79/254.99 c intdiving : 0.00 0 0
254.79/254.99 c actconsdiving : 0.00 0 0
254.79/254.99 c objpscostdiving : 0.00 0 0
254.79/254.99 c rootsoldiving : 0.00 0 0
254.79/254.99 c linesearchdiving : 0.00 0 0
254.79/254.99 c guideddiving : 0.00 0 0
254.79/254.99 c octane : 0.00 0 0
254.79/254.99 c rens : 0.00 0 0
254.79/254.99 c rins : 0.00 0 0
254.79/254.99 c localbranching : 0.00 0 0
254.79/254.99 c mutation : 0.00 0 0
254.79/254.99 c crossover : 0.00 0 0
254.79/254.99 c dins : 0.00 0 0
254.79/254.99 c LP : Time Calls Iterations Iter/call Iter/sec
254.79/254.99 c primal LP : 19.25 0 0 0.00 0.00
254.79/254.99 c dual LP : 131.24 1943 379050 195.08 2888.22
254.79/254.99 c barrier LP : 0.00 0 0 0.00 -
254.79/254.99 c diving/probing LP: 0.00 0 0 0.00 -
254.79/254.99 c strong branching : 82.71 3879 289752 74.70 3503.23
254.79/254.99 c (at root node) : - 33 7694 233.15 -
254.79/254.99 c conflict analysis: 0.00 0 0 0.00 -
254.79/254.99 c B&B Tree :
254.79/254.99 c number of runs : 1
254.79/254.99 c nodes : 1149
254.79/254.99 c nodes (total) : 1149
254.79/254.99 c nodes left : 0
254.79/254.99 c max depth : 86
254.79/254.99 c max depth (total): 86
254.79/254.99 c backtracks : 252 (21.9%)
254.79/254.99 c delayed cutoffs : 0
254.79/254.99 c repropagations : 43 (68 domain reductions, 0 cutoffs)
254.79/254.99 c avg switch length: 5.92
254.79/254.99 c switching time : 20.71
254.79/254.99 c Solution :
254.79/254.99 c Solutions found : 0 (0 improvements)
254.79/254.99 c Primal Bound : infeasible
254.79/254.99 c Dual Bound : -
254.79/254.99 c Gap : 0.00 %
254.79/254.99 c Root Dual Bound : +8.00000000000001e+01
254.89/255.04 c Time complete: 254.93.