0.00/0.04 c SCIP version 1.1.0.7
0.00/0.04 c LP-Solver Clp 1.8.2
0.00/0.04 c user parameter file <scip.set> not found - using default parameters
0.00/0.04 c read problem <HOME/instance-1870745-1245217991.opb>
0.00/0.04 c original problem has 3274 variables (3274 bin, 0 int, 0 impl, 0 cont) and 3376 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.24 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 301 upgd conss, 24792 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 24792 implications, 200 cliques
0.29/0.39 c presolved problem has 3274 variables (3274 bin, 0 int, 0 impl, 0 cont) and 3376 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 3074 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 | 179 | 14M| 0 | 160 |3274 |3376 |3376 |3274 |6450 | 0 | 0 | 0 | 8.000000e+01 | -- | Inf
0.99/1.08 c 0.8s| 1 | 0 | 292 | 14M| 0 | 161 |3274 |3376 |3376 |3274 |6452 | 2 | 0 | 0 | 8.000000e+01 | -- | Inf
2.28/2.34 c 2.1s| 1 | 0 | 406 | 14M| 0 | 168 |3274 |3376 |3376 |3274 |6453 | 3 | 0 | 0 | 8.000000e+01 | -- | Inf
4.29/4.31 c 4.0s| 1 | 0 | 442 | 14M| 0 | 168 |3274 |3376 |3376 |3274 |6454 | 4 | 0 | 0 | 8.000000e+01 | -- | Inf
6.29/6.31 c 6.0s| 1 | 0 | 456 | 14M| 0 | 168 |3274 |3376 |3376 |3274 |6455 | 5 | 0 | 0 | 8.000000e+01 | -- | Inf
9.49/9.51 c 9.2s| 1 | 0 | 463 | 14M| 0 | 168 |3274 |3376 |3376 |3274 |6456 | 6 | 0 | 0 | 8.000000e+01 | -- | Inf
18.98/19.08 c 18.8s| 1 | 2 | 463 | 14M| 0 | 168 |3274 |3376 |3376 |3274 |6456 | 6 | 0 | 33 | 8.000000e+01 | -- | Inf
259.59/259.77 c
259.59/259.77 c SCIP Status : problem is solved [infeasible]
259.59/259.77 c Solving Time (sec) : 258.82
259.59/259.77 c Solving Nodes : 1091
259.59/259.77 c Primal Bound : +1.00000000000000e+20 (0 solutions)
259.59/259.77 c Dual Bound : +1.00000000000000e+20
259.59/259.77 c Gap : 0.00 %
259.59/259.77 c NODE 1091
259.59/259.77 c DUAL BOUND 1e+20
259.59/259.77 c PRIMAL BOUND 1e+20
259.59/259.77 c GAP 0
259.59/259.77 s UNSATISFIABLE
259.59/259.77 c SCIP Status : problem is solved [infeasible]
259.59/259.77 c Solving Time : 258.82
259.59/259.77 c Original Problem :
259.59/259.77 c Problem name : HOME/instance-1870745-1245217991.opb
259.59/259.77 c Variables : 3274 (3274 binary, 0 integer, 0 implicit integer, 0 continuous)
259.59/259.77 c Constraints : 3376 initial, 3376 maximal
259.59/259.77 c Presolved Problem :
259.59/259.77 c Problem name : t_HOME/instance-1870745-1245217991.opb
259.59/259.77 c Variables : 3274 (3274 binary, 0 integer, 0 implicit integer, 0 continuous)
259.59/259.77 c Constraints : 3376 initial, 3380 maximal
259.59/259.77 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
259.59/259.77 c trivial : 0.00 0 0 0 0 0 0 0 0
259.59/259.77 c dualfix : 0.00 0 0 0 0 0 0 0 0
259.59/259.77 c boundshift : 0.00 0 0 0 0 0 0 0 0
259.59/259.77 c inttobinary : 0.00 0 0 0 0 0 0 0 0
259.59/259.77 c implics : 0.00 0 0 0 0 0 0 0 0
259.59/259.77 c probing : 0.00 0 0 0 0 0 0 0 0
259.59/259.77 c knapsack : 0.00 0 0 0 0 0 0 0 0
259.59/259.77 c setppc : 0.01 0 0 0 0 0 0 0 0
259.59/259.77 c and : 0.12 0 0 0 0 0 0 0 0
259.59/259.77 c linear : 0.02 0 0 0 0 0 0 0 0
259.59/259.77 c logicor : 0.00 0 0 0 0 0 0 0 0
259.59/259.77 c root node : - 70 - - 70 - - - -
259.59/259.77 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
259.59/259.77 c integral : 0 0 0 573 0 8 50 0 0 1090
259.59/259.77 c knapsack : 1 5 2748 5 0 0 0 0 0 0
259.59/259.77 c setppc : 200 5 2748 5 0 2 16688 0 0 0
259.59/259.77 c and : 3074 784 2746 5 0 2 430559 270083 0 0
259.59/259.77 c linear : 1 5 2744 0 0 0 0 0 0 0
259.59/259.77 c logicor : 100+ 5 907 0 0 0 699 0 0 0
259.59/259.77 c countsols : 0 0 0 0 0 0 0 0 0 0
259.59/259.77 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
259.59/259.77 c integral : 88.92 0.00 0.00 88.92 0.00
259.59/259.77 c knapsack : 0.00 0.00 0.00 0.00 0.00
259.59/259.77 c setppc : 0.10 0.00 0.10 0.00 0.00
259.59/259.77 c and : 4.29 2.33 1.94 0.02 0.00
259.59/259.77 c linear : 0.03 0.00 0.03 0.00 0.00
259.59/259.77 c logicor : 0.00 0.00 0.00 0.00 0.00
259.59/259.77 c countsols : 0.00 0.00 0.00 0.00 0.00
259.59/259.77 c Propagators : Time Calls Cutoffs DomReds
259.59/259.77 c rootredcost : 0.00 0 0 0
259.59/259.77 c pseudoobj : 1.14 2775 1 0
259.59/259.77 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
259.59/259.77 c propagation : 0.00 4 4 4 2.5 0 0.0 -
259.59/259.77 c infeasible LP : 0.53 533 0 0 0.0 0 0.0 0
259.59/259.77 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
259.59/259.77 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
259.59/259.77 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
259.59/259.77 c applied globally : - - - 4 2.5 - - -
259.59/259.77 c applied locally : - - - 0 0.0 - - -
259.59/259.77 c Separators : Time Calls Cutoffs DomReds Cuts Conss
259.59/259.77 c cut pool : 0.00 4 - - 0 - (maximal pool size: 22)
259.59/259.77 c redcost : 0.38 784 0 0 0 0
259.59/259.77 c impliedbounds : 0.00 5 0 0 0 0
259.59/259.77 c intobj : 0.00 0 0 0 0 0
259.59/259.77 c gomory : 6.03 5 0 0 642 0
259.59/259.77 c strongcg : 2.46 5 0 0 2228 0
259.59/259.77 c cmir : 0.00 0 0 0 0 0
259.59/259.77 c flowcover : 0.00 0 0 0 0 0
259.59/259.77 c clique : 0.02 5 0 0 0 0
259.59/259.77 c zerohalf : 0.00 0 0 0 0 0
259.59/259.77 c mcf : 0.05 2 0 0 0 0
259.59/259.77 c Pricers : Time Calls Vars
259.59/259.77 c problem variables: 0.00 0 0
259.59/259.77 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
259.59/259.77 c relpscost : 88.91 568 8 50 0 0 1090
259.59/259.77 c pscost : 0.00 0 0 0 0 0 0
259.59/259.77 c inference : 0.00 0 0 0 0 0 0
259.59/259.77 c mostinf : 0.00 0 0 0 0 0 0
259.59/259.77 c leastinf : 0.00 0 0 0 0 0 0
259.59/259.77 c fullstrong : 0.00 0 0 0 0 0 0
259.59/259.77 c allfullstrong : 0.00 0 0 0 0 0 0
259.59/259.77 c random : 0.00 0 0 0 0 0 0
259.59/259.77 c Primal Heuristics : Time Calls Found
259.59/259.77 c LP solutions : 0.00 - 0
259.59/259.77 c pseudo solutions : 0.00 - 0
259.59/259.77 c simplerounding : 0.00 0 0
259.59/259.77 c rounding : 0.00 0 0
259.59/259.77 c shifting : 0.00 0 0
259.59/259.77 c intshifting : 0.00 0 0
259.59/259.77 c oneopt : 0.00 0 0
259.59/259.77 c fixandinfer : 0.00 0 0
259.59/259.77 c feaspump : 0.00 0 0
259.59/259.77 c coefdiving : 0.00 0 0
259.59/259.77 c pscostdiving : 0.00 0 0
259.59/259.77 c fracdiving : 0.00 0 0
259.59/259.77 c veclendiving : 0.00 0 0
259.59/259.77 c intdiving : 0.00 0 0
259.59/259.77 c actconsdiving : 0.00 0 0
259.59/259.77 c objpscostdiving : 0.00 0 0
259.59/259.77 c rootsoldiving : 0.00 0 0
259.59/259.77 c linesearchdiving : 0.00 0 0
259.59/259.77 c guideddiving : 0.00 0 0
259.59/259.77 c octane : 0.00 0 0
259.59/259.77 c rens : 0.00 0 0
259.59/259.77 c rins : 0.00 0 0
259.59/259.77 c localbranching : 0.00 0 0
259.59/259.77 c mutation : 0.00 0 0
259.59/259.77 c crossover : 0.00 0 0
259.59/259.77 c dins : 0.00 0 0
259.59/259.77 c LP : Time Calls Iterations Iter/call Iter/sec
259.59/259.77 c primal LP : 19.32 0 0 0.00 0.00
259.59/259.77 c dual LP : 128.40 1867 372022 199.26 2897.37
259.59/259.77 c barrier LP : 0.00 0 0 0.00 -
259.59/259.77 c diving/probing LP: 0.00 0 0 0.00 -
259.59/259.77 c strong branching : 88.73 3473 286429 82.47 3228.10
259.59/259.77 c (at root node) : - 33 7312 221.58 -
259.59/259.77 c conflict analysis: 0.00 0 0 0.00 -
259.59/259.77 c B&B Tree :
259.59/259.77 c number of runs : 1
259.59/259.77 c nodes : 1091
259.59/259.77 c nodes (total) : 1091
259.59/259.77 c nodes left : 0
259.59/259.77 c max depth : 64
259.59/259.77 c max depth (total): 64
259.59/259.77 c backtracks : 233 (21.4%)
259.59/259.77 c delayed cutoffs : 0
259.59/259.77 c repropagations : 6 (61 domain reductions, 0 cutoffs)
259.59/259.77 c avg switch length: 5.44
259.59/259.77 c switching time : 20.71
259.59/259.77 c Solution :
259.59/259.77 c Solutions found : 0 (0 improvements)
259.59/259.77 c Primal Bound : infeasible
259.59/259.77 c Dual Bound : -
259.59/259.77 c Gap : 0.00 %
259.59/259.77 c Root Dual Bound : +8.00000000000002e+01
259.69/259.82 c Time complete: 259.71.