0.02/0.04 c SCIP version 1.1.0.7
0.02/0.04 c LP-Solver Clp 1.8.2
0.02/0.04 c user parameter file <scip.set> not found - using default parameters
0.02/0.04 c read problem <HOME/instance-1868367-1245122621.opb>
0.02/0.04 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.02/0.05 c No objective function, only one solution is needed.
0.02/0.05 c start presolving problem
0.02/0.05 c presolving:
0.02/0.09 c (round 1) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.10/0.10 c (round 2) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.10/0.11 c presolving (3 rounds):
0.10/0.11 c 0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.10/0.11 c 242 implications, 22 cliques
0.10/0.11 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2564 constraints
0.10/0.11 c 1 constraints of type <knapsack>
0.10/0.11 c 22 constraints of type <setppc>
0.10/0.11 c 2541 constraints of type <logicor>
0.10/0.11 c transformed objective value is always integral (scale: 1)
0.10/0.11 c Presolving Time: 0.05
0.10/0.11 c SATUNSAT-LIN
0.10/0.11 c -----------------------------------------------------------------------------------------------
0.10/0.11 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.11 c separating/flowcover/freq = c -1
0.10/0.11 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.11 c separating/cmir/freq = c -1
0.10/0.11 c # additional number of allowed LP iterations
0.10/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.11 c heuristics/veclendiving/maxlpiterofs = c 1500
0.10/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.11 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.10/0.11 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.11 c heuristics/veclendiving/freq = c -1
0.10/0.11 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.11 c heuristics/simplerounding/freq = c -1
0.10/0.11 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.11 c heuristics/shifting/freq = c -1
0.10/0.11 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.11 c heuristics/rounding/freq = c -1
0.10/0.11 c # additional number of allowed LP iterations
0.10/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.11 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.10/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.10/0.11 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.10/0.11 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.11 c heuristics/rootsoldiving/freq = c -1
0.10/0.11 c # number of nodes added to the contingent of the total nodes
0.10/0.11 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.10/0.11 c heuristics/rens/nodesofs = c 2000
0.10/0.11 c # minimum percentage of integer variables that have to be fixable
0.10/0.11 c # [type: real, range: [0,1], default: 0.5]
0.10/0.11 c heuristics/rens/minfixingrate = c 0.3
0.10/0.11 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.10/0.11 c heuristics/rens/freq = c -1
0.10/0.11 c # additional number of allowed LP iterations
0.10/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.11 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.10/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.11 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.10/0.11 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.11 c heuristics/pscostdiving/freq = c -1
0.10/0.11 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.10/0.11 c heuristics/oneopt/freq = c -1
0.10/0.11 c # additional number of allowed LP iterations
0.10/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.11 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.10/0.11 c # maximal fraction of diving LP iterations compared to total iteration number
0.10/0.11 c # [type: real, range: [0,1], default: 0.01]
0.10/0.11 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.10/0.11 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.11 c heuristics/objpscostdiving/freq = c -1
0.10/0.11 c # additional number of allowed LP iterations
0.10/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.11 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.10/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.11 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.10/0.11 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.11 c heuristics/linesearchdiving/freq = c -1
0.10/0.11 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.11 c heuristics/intshifting/freq = c -1
0.10/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.11 c heuristics/intdiving/maxlpiterquot = c 0.075
0.10/0.11 c # additional number of allowed LP iterations
0.10/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.11 c heuristics/guideddiving/maxlpiterofs = c 1500
0.10/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.11 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.10/0.11 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.11 c heuristics/guideddiving/freq = c -1
0.10/0.11 c # additional number of allowed LP iterations
0.10/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.11 c heuristics/fracdiving/maxlpiterofs = c 1500
0.10/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.11 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.10/0.11 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.11 c heuristics/fracdiving/freq = c -1
0.10/0.11 c # additional number of allowed LP iterations
0.10/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.11 c heuristics/feaspump/maxlpiterofs = c 2000
0.10/0.11 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 20]
0.10/0.11 c heuristics/feaspump/freq = c -1
0.10/0.11 c # minimum percentage of integer variables that have to be fixed
0.10/0.11 c # [type: real, range: [0,1], default: 0.666]
0.10/0.11 c heuristics/crossover/minfixingrate = c 0.5
0.10/0.11 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.10/0.11 c # [type: real, range: [0,1], default: 0.1]
0.10/0.11 c heuristics/crossover/nodesquot = c 0.15
0.10/0.11 c # number of nodes without incumbent change that heuristic should wait
0.10/0.11 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.10/0.11 c heuristics/crossover/nwaitingnodes = c 100
0.10/0.11 c # number of nodes added to the contingent of the total nodes
0.10/0.11 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.10/0.11 c heuristics/crossover/nodesofs = c 750
0.10/0.11 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 30]
0.10/0.11 c heuristics/crossover/freq = c -1
0.10/0.11 c # additional number of allowed LP iterations
0.10/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.10/0.11 c heuristics/coefdiving/maxlpiterofs = c 1500
0.10/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.10/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.10/0.11 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.10/0.11 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.10/0.11 c heuristics/coefdiving/freq = c -1
0.10/0.11 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.11 c presolving/probing/maxrounds = c 0
0.10/0.11 c # should presolving try to simplify knapsacks
0.10/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.11 c constraints/knapsack/simplifyinequalities = c TRUE
0.10/0.11 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.10/0.11 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.10/0.11 c constraints/knapsack/disaggregation = c FALSE
0.10/0.11 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.11 c constraints/knapsack/maxnumcardlift = c 0
0.10/0.11 c # should presolving try to simplify inequalities
0.10/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.10/0.11 c constraints/linear/simplifyinequalities = c TRUE
0.10/0.11 c # maximal number of separation rounds in the root node (-1: unlimited)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.11 c separating/maxroundsroot = c 5
0.10/0.11 c # maximal number of separation rounds per node (-1: unlimited)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 5]
0.10/0.11 c separating/maxrounds = c 1
0.10/0.11 c # solving stops, if the given number of solutions were found (-1: no limit)
0.10/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.10/0.11 c limits/solutions = c 1
0.10/0.11 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.10/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.10/0.11 c limits/memory = c 1620
0.10/0.11 c # maximal time in seconds to run
0.10/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.10/0.11 c limits/time = c 1791
0.10/0.11 c # frequency for displaying node information lines
0.10/0.11 c # [type: int, range: [-1,2147483647], default: 100]
0.10/0.11 c display/freq = c 10000
0.10/0.11 c -----------------------------------------------------------------------------------------------
0.10/0.11 c start solving problem
0.10/0.11 c
0.10/0.14 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.10/0.14 c 0.1s| 1 | 0 | 63 |3513k| 0 | 35 | 231 |2564 |2564 | 231 |2564 | 0 | 0 | 0 | 1.100000e+01 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 108 |3739k| 0 | 50 | 231 |2564 |2564 | 231 |2568 | 4 | 0 | 0 | 1.100000e+01 | -- | Inf
0.50/0.54 c 0.5s| 1 | 0 | 154 |4045k| 0 | 54 | 231 |2564 |2564 | 231 |2571 | 7 | 0 | 0 | 1.100000e+01 | -- | Inf
0.69/0.73 c 0.7s| 1 | 0 | 314 |4255k| 0 | 43 | 231 |2564 |2564 | 231 |2575 | 11 | 0 | 0 | 1.100000e+01 | -- | Inf
0.99/1.05 c 1.0s| 1 | 0 | 454 |4617k| 0 | 47 | 231 |2564 |2564 | 231 |2579 | 15 | 0 | 0 | 1.100000e+01 | -- | Inf
1.28/1.31 c 1.2s| 1 | 0 | 520 |4753k| 0 | 51 | 231 |2564 |2564 | 231 |2583 | 19 | 0 | 0 | 1.100000e+01 | -- | Inf
2.19/2.28 c 2.2s| 1 | 2 | 520 |4754k| 0 | 51 | 231 |2564 |2564 | 231 |2583 | 19 | 0 | 20 | 1.100000e+01 | -- | Inf
134.41/134.56 c 133s| 10000 | 480 |380255 |6353k| 51 | 36 | 231 |2918 |1562 | 231 |2569 | 19 |1177 |2590 | 1.500000e+01 | -- | Inf
223.97/224.14 c 222s| 20000 | 416 |699912 |6451k| 54 | - | 231 |2746 |1150 | 231 |2569 | 19 |1739 |2879 | 1.500000e+01 | -- | Inf
261.86/262.03 c
261.86/262.03 c SCIP Status : problem is solved [infeasible]
261.86/262.03 c Solving Time (sec) : 259.82
261.86/262.03 c Solving Nodes : 24741
261.86/262.03 c Primal Bound : +1.00000000000000e+20 (0 solutions)
261.86/262.03 c Dual Bound : +1.00000000000000e+20
261.86/262.03 c Gap : 0.00 %
261.86/262.03 c NODE 24741
261.86/262.03 c DUAL BOUND 1e+20
261.86/262.03 c PRIMAL BOUND 1e+20
261.86/262.03 c GAP 0
261.86/262.03 s UNSATISFIABLE
261.86/262.03 c SCIP Status : problem is solved [infeasible]
261.86/262.03 c Solving Time : 259.82
261.86/262.03 c Original Problem :
261.86/262.03 c Problem name : HOME/instance-1868367-1245122621.opb
261.86/262.03 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
261.86/262.03 c Constraints : 2707 initial, 2707 maximal
261.86/262.03 c Presolved Problem :
261.86/262.03 c Problem name : t_HOME/instance-1868367-1245122621.opb
261.86/262.03 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
261.86/262.03 c Constraints : 2564 initial, 3130 maximal
261.86/262.03 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
261.86/262.03 c trivial : 0.00 0 0 0 0 0 0 0 0
261.86/262.03 c dualfix : 0.00 0 0 0 0 0 0 0 0
261.86/262.03 c boundshift : 0.00 0 0 0 0 0 0 0 0
261.86/262.03 c inttobinary : 0.00 0 0 0 0 0 0 0 0
261.86/262.03 c implics : 0.00 0 0 0 0 0 0 0 0
261.86/262.03 c probing : 0.00 0 0 0 0 0 0 0 0
261.86/262.03 c knapsack : 0.00 0 0 0 0 0 0 0 0
261.86/262.03 c setppc : 0.00 0 0 0 0 0 0 0 0
261.86/262.03 c linear : 0.02 0 0 0 0 0 143 0 0
261.86/262.03 c logicor : 0.02 0 0 0 0 0 0 0 0
261.86/262.03 c root node : - 21 - - 21 - - - -
261.86/262.03 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
261.86/262.03 c integral : 0 0 0 13213 0 153 1303 0 0 24804
261.86/262.03 c knapsack : 1 5 53517 0 0 123 66694 0 0 0
261.86/262.03 c setppc : 22 5 53501 0 0 690 134793 0 0 0
261.86/262.03 c logicor : 2541+ 5 46192 0 0 143 142758 0 0 0
261.86/262.03 c countsols : 0 0 0 0 0 0 0 0 0 0
261.86/262.03 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
261.86/262.03 c integral : 45.46 0.00 0.00 45.46 0.00
261.86/262.03 c knapsack : 0.27 0.00 0.27 0.00 0.00
261.86/262.03 c setppc : 0.64 0.00 0.64 0.00 0.00
261.86/262.03 c logicor : 3.39 0.00 3.39 0.00 0.00
261.86/262.03 c countsols : 0.00 0.00 0.00 0.00 0.00
261.86/262.03 c Propagators : Time Calls Cutoffs DomReds
261.86/262.03 c rootredcost : 0.01 0 0 0
261.86/262.03 c pseudoobj : 0.75 53631 1 0
261.86/262.03 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
261.86/262.03 c propagation : 0.06 956 956 4077 15.4 9 14.6 -
261.86/262.03 c infeasible LP : 0.34 11293 0 0 0.0 0 0.0 0
261.86/262.03 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
261.86/262.03 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
261.86/262.03 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
261.86/262.03 c applied globally : - - - 2166 14.2 - - -
261.86/262.03 c applied locally : - - - 1 34.0 - - -
261.86/262.03 c Separators : Time Calls Cutoffs DomReds Cuts Conss
261.86/262.03 c cut pool : 0.00 4 - - 1 - (maximal pool size: 427)
261.86/262.03 c redcost : 0.25 12598 0 0 0 0
261.86/262.03 c impliedbounds : 0.00 5 0 0 0 0
261.86/262.03 c intobj : 0.00 0 0 0 0 0
261.86/262.03 c gomory : 0.65 5 0 0 2131 0
261.86/262.03 c strongcg : 0.34 5 0 0 2500 0
261.86/262.03 c cmir : 0.00 0 0 0 0 0
261.86/262.03 c flowcover : 0.00 0 0 0 0 0
261.86/262.03 c clique : 0.00 5 0 0 0 0
261.86/262.03 c zerohalf : 0.00 0 0 0 0 0
261.86/262.03 c mcf : 0.00 1 0 0 0 0
261.86/262.03 c Pricers : Time Calls Vars
261.86/262.03 c problem variables: 0.00 0 0
261.86/262.03 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
261.86/262.03 c relpscost : 45.41 13213 153 1303 0 0 24804
261.86/262.03 c pscost : 0.00 0 0 0 0 0 0
261.86/262.03 c inference : 0.00 0 0 0 0 0 0
261.86/262.03 c mostinf : 0.00 0 0 0 0 0 0
261.86/262.03 c leastinf : 0.00 0 0 0 0 0 0
261.86/262.03 c fullstrong : 0.00 0 0 0 0 0 0
261.86/262.03 c allfullstrong : 0.00 0 0 0 0 0 0
261.86/262.03 c random : 0.00 0 0 0 0 0 0
261.86/262.03 c Primal Heuristics : Time Calls Found
261.86/262.03 c LP solutions : 0.00 - 0
261.86/262.03 c pseudo solutions : 0.00 - 0
261.86/262.03 c simplerounding : 0.00 0 0
261.86/262.03 c rounding : 0.00 0 0
261.86/262.03 c shifting : 0.00 0 0
261.86/262.03 c intshifting : 0.00 0 0
261.86/262.03 c oneopt : 0.00 0 0
261.86/262.03 c fixandinfer : 0.00 0 0
261.86/262.03 c feaspump : 0.00 0 0
261.86/262.03 c coefdiving : 0.00 0 0
261.86/262.03 c pscostdiving : 0.00 0 0
261.86/262.03 c fracdiving : 0.00 0 0
261.86/262.03 c veclendiving : 0.00 0 0
261.86/262.03 c intdiving : 0.00 0 0
261.86/262.03 c actconsdiving : 0.00 0 0
261.86/262.03 c objpscostdiving : 0.00 0 0
261.86/262.03 c rootsoldiving : 0.00 0 0
261.86/262.03 c linesearchdiving : 0.00 0 0
261.86/262.03 c guideddiving : 0.00 0 0
261.86/262.03 c octane : 0.00 0 0
261.86/262.03 c rens : 0.00 0 0
261.86/262.03 c rins : 0.00 0 0
261.86/262.03 c localbranching : 0.00 0 0
261.86/262.03 c mutation : 0.00 0 0
261.86/262.03 c crossover : 0.00 0 0
261.86/262.03 c dins : 0.00 0 0
261.86/262.03 c LP : Time Calls Iterations Iter/call Iter/sec
261.86/262.03 c primal LP : 0.01 0 0 0.00 0.00
261.86/262.03 c dual LP : 196.35 24456 811851 33.20 4134.71
261.86/262.03 c barrier LP : 0.00 0 0 0.00 -
261.86/262.03 c diving/probing LP: 0.00 0 0 0.00 -
261.86/262.03 c strong branching : 44.97 3215 201869 62.79 4488.97
261.86/262.03 c (at root node) : - 20 3263 163.15 -
261.86/262.03 c conflict analysis: 0.00 0 0 0.00 -
261.86/262.03 c B&B Tree :
261.86/262.03 c number of runs : 1
261.86/262.03 c nodes : 24741
261.86/262.03 c nodes (total) : 24741
261.86/262.03 c nodes left : 0
261.86/262.03 c max depth : 56
261.86/262.03 c max depth (total): 56
261.86/262.03 c backtracks : 2504 (10.1%)
261.86/262.03 c delayed cutoffs : 64
261.86/262.03 c repropagations : 2158 (8059 domain reductions, 64 cutoffs)
261.86/262.03 c avg switch length: 4.05
261.86/262.03 c switching time : 3.33
261.86/262.03 c Solution :
261.86/262.03 c Solutions found : 0 (0 improvements)
261.86/262.03 c Primal Bound : infeasible
261.86/262.03 c Dual Bound : -
261.86/262.03 c Gap : 0.00 %
261.86/262.03 c Root Dual Bound : +1.10000000000000e+01
261.86/262.04 c Time complete: 261.9.