0.09/0.16 c SCIP version 1.1.0.7
0.09/0.16 c LP-Solver Clp 1.8.2
0.09/0.16 c user parameter file <scip.set> not found - using default parameters
0.09/0.16 c read problem <HOME/instance-1868609-1245129130.opb>
0.09/0.16 c original problem has 3736 variables (3736 bin, 0 int, 0 impl, 0 cont) and 10457 constraints
0.19/0.21 c No objective function, only one solution is needed.
0.19/0.21 c start presolving problem
0.19/0.21 c presolving:
0.39/0.41 c (round 1) 473 del vars, 471 del conss, 175 chg bounds, 184 chg sides, 460 chg coeffs, 0 upgd conss, 206361 impls, 0 clqs
0.39/0.43 c (round 2) 484 del vars, 1192 del conss, 186 chg bounds, 184 chg sides, 460 chg coeffs, 0 upgd conss, 206395 impls, 0 clqs
0.39/0.44 c (round 3) 498 del vars, 1216 del conss, 192 chg bounds, 184 chg sides, 460 chg coeffs, 0 upgd conss, 206515 impls, 0 clqs
0.39/0.44 c (round 4) 499 del vars, 1238 del conss, 192 chg bounds, 184 chg sides, 460 chg coeffs, 0 upgd conss, 206585 impls, 0 clqs
0.39/0.45 c (round 5) 499 del vars, 1240 del conss, 192 chg bounds, 184 chg sides, 460 chg coeffs, 0 upgd conss, 206585 impls, 0 clqs
0.50/0.55 c (round 6) 499 del vars, 1251 del conss, 192 chg bounds, 184 chg sides, 460 chg coeffs, 9206 upgd conss, 206585 impls, 0 clqs
0.50/0.59 c presolving (7 rounds):
0.50/0.59 c 499 deleted vars, 1251 deleted constraints, 192 tightened bounds, 0 added holes, 184 changed sides, 460 changed coefficients
0.50/0.59 c 206585 implications, 0 cliques
0.50/0.59 c presolved problem has 3237 variables (3237 bin, 0 int, 0 impl, 0 cont) and 9206 constraints
0.50/0.59 c 368 constraints of type <knapsack>
0.50/0.59 c 8838 constraints of type <logicor>
0.50/0.59 c transformed objective value is always integral (scale: 1)
0.50/0.59 c Presolving Time: 0.35
0.50/0.59 c SATUNSAT-LIN
0.50/0.59 c -----------------------------------------------------------------------------------------------
0.50/0.59 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.50/0.59 c # [type: int, range: [-1,2147483647], default: 0]
0.50/0.59 c separating/flowcover/freq = c -1
0.50/0.59 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.50/0.59 c # [type: int, range: [-1,2147483647], default: 0]
0.50/0.59 c separating/cmir/freq = c -1
0.50/0.59 c # additional number of allowed LP iterations
0.50/0.59 c # [type: int, range: [0,2147483647], default: 1000]
0.50/0.59 c heuristics/veclendiving/maxlpiterofs = c 1500
0.50/0.59 c # maximal fraction of diving LP iterations compared to node LP iterations
0.50/0.59 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.50/0.59 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.50/0.59 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.50/0.59 c # [type: int, range: [-1,2147483647], default: 10]
0.50/0.59 c heuristics/veclendiving/freq = c -1
0.50/0.59 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.50/0.59 c # [type: int, range: [-1,2147483647], default: 1]
0.50/0.59 c heuristics/simplerounding/freq = c -1
0.50/0.59 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.50/0.59 c # [type: int, range: [-1,2147483647], default: 10]
0.50/0.59 c heuristics/shifting/freq = c -1
0.50/0.59 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.50/0.59 c # [type: int, range: [-1,2147483647], default: 1]
0.50/0.59 c heuristics/rounding/freq = c -1
0.50/0.59 c # additional number of allowed LP iterations
0.50/0.59 c # [type: int, range: [0,2147483647], default: 1000]
0.50/0.59 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.50/0.59 c # maximal fraction of diving LP iterations compared to node LP iterations
0.50/0.59 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.50/0.59 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.50/0.59 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.50/0.59 c # [type: int, range: [-1,2147483647], default: 20]
0.50/0.59 c heuristics/rootsoldiving/freq = c -1
0.50/0.59 c # number of nodes added to the contingent of the total nodes
0.50/0.59 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.50/0.59 c heuristics/rens/nodesofs = c 2000
0.50/0.59 c # minimum percentage of integer variables that have to be fixable
0.50/0.59 c # [type: real, range: [0,1], default: 0.5]
0.50/0.59 c heuristics/rens/minfixingrate = c 0.3
0.50/0.59 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.50/0.59 c # [type: int, range: [-1,2147483647], default: 0]
0.50/0.59 c heuristics/rens/freq = c -1
0.50/0.59 c # additional number of allowed LP iterations
0.50/0.59 c # [type: int, range: [0,2147483647], default: 1000]
0.50/0.59 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.50/0.59 c # maximal fraction of diving LP iterations compared to node LP iterations
0.50/0.59 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.50/0.59 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.50/0.59 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.50/0.59 c # [type: int, range: [-1,2147483647], default: 10]
0.50/0.59 c heuristics/pscostdiving/freq = c -1
0.50/0.59 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.50/0.59 c # [type: int, range: [-1,2147483647], default: 1]
0.50/0.59 c heuristics/oneopt/freq = c -1
0.50/0.59 c # additional number of allowed LP iterations
0.50/0.59 c # [type: int, range: [0,2147483647], default: 1000]
0.50/0.59 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.50/0.59 c # maximal fraction of diving LP iterations compared to total iteration number
0.50/0.59 c # [type: real, range: [0,1], default: 0.01]
0.50/0.59 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.50/0.59 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.50/0.59 c # [type: int, range: [-1,2147483647], default: 20]
0.50/0.59 c heuristics/objpscostdiving/freq = c -1
0.50/0.59 c # additional number of allowed LP iterations
0.50/0.59 c # [type: int, range: [0,2147483647], default: 1000]
0.50/0.59 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.50/0.59 c # maximal fraction of diving LP iterations compared to node LP iterations
0.50/0.59 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.50/0.59 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.50/0.59 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.50/0.59 c # [type: int, range: [-1,2147483647], default: 10]
0.50/0.59 c heuristics/linesearchdiving/freq = c -1
0.50/0.59 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.50/0.59 c # [type: int, range: [-1,2147483647], default: 10]
0.50/0.59 c heuristics/intshifting/freq = c -1
0.50/0.59 c # maximal fraction of diving LP iterations compared to node LP iterations
0.50/0.59 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.50/0.59 c heuristics/intdiving/maxlpiterquot = c 0.075
0.50/0.59 c # additional number of allowed LP iterations
0.50/0.59 c # [type: int, range: [0,2147483647], default: 1000]
0.50/0.59 c heuristics/guideddiving/maxlpiterofs = c 1500
0.50/0.59 c # maximal fraction of diving LP iterations compared to node LP iterations
0.50/0.59 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.50/0.59 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.50/0.59 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.50/0.59 c # [type: int, range: [-1,2147483647], default: 10]
0.50/0.59 c heuristics/guideddiving/freq = c -1
0.50/0.59 c # additional number of allowed LP iterations
0.50/0.59 c # [type: int, range: [0,2147483647], default: 1000]
0.50/0.59 c heuristics/fracdiving/maxlpiterofs = c 1500
0.50/0.59 c # maximal fraction of diving LP iterations compared to node LP iterations
0.50/0.59 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.50/0.59 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.50/0.59 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.50/0.59 c # [type: int, range: [-1,2147483647], default: 10]
0.50/0.59 c heuristics/fracdiving/freq = c -1
0.50/0.59 c # additional number of allowed LP iterations
0.50/0.59 c # [type: int, range: [0,2147483647], default: 1000]
0.50/0.59 c heuristics/feaspump/maxlpiterofs = c 2000
0.50/0.59 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.50/0.59 c # [type: int, range: [-1,2147483647], default: 20]
0.50/0.59 c heuristics/feaspump/freq = c -1
0.50/0.59 c # minimum percentage of integer variables that have to be fixed
0.50/0.59 c # [type: real, range: [0,1], default: 0.666]
0.50/0.59 c heuristics/crossover/minfixingrate = c 0.5
0.50/0.59 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.50/0.59 c # [type: real, range: [0,1], default: 0.1]
0.50/0.59 c heuristics/crossover/nodesquot = c 0.15
0.50/0.59 c # number of nodes without incumbent change that heuristic should wait
0.50/0.59 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.50/0.59 c heuristics/crossover/nwaitingnodes = c 100
0.50/0.59 c # number of nodes added to the contingent of the total nodes
0.50/0.59 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.50/0.59 c heuristics/crossover/nodesofs = c 750
0.50/0.59 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.50/0.59 c # [type: int, range: [-1,2147483647], default: 30]
0.50/0.59 c heuristics/crossover/freq = c -1
0.50/0.59 c # additional number of allowed LP iterations
0.50/0.59 c # [type: int, range: [0,2147483647], default: 1000]
0.50/0.59 c heuristics/coefdiving/maxlpiterofs = c 1500
0.50/0.59 c # maximal fraction of diving LP iterations compared to node LP iterations
0.50/0.59 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.50/0.59 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.50/0.59 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.50/0.59 c # [type: int, range: [-1,2147483647], default: 10]
0.50/0.59 c heuristics/coefdiving/freq = c -1
0.50/0.59 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.50/0.59 c # [type: int, range: [-1,2147483647], default: -1]
0.50/0.59 c presolving/probing/maxrounds = c 0
0.50/0.59 c # should presolving try to simplify knapsacks
0.50/0.59 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.50/0.59 c constraints/knapsack/simplifyinequalities = c TRUE
0.50/0.59 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.50/0.59 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.50/0.59 c constraints/knapsack/disaggregation = c FALSE
0.50/0.59 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.50/0.59 c # [type: int, range: [-1,2147483647], default: -1]
0.50/0.59 c constraints/knapsack/maxnumcardlift = c 0
0.50/0.59 c # should presolving try to simplify inequalities
0.50/0.59 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.50/0.59 c constraints/linear/simplifyinequalities = c TRUE
0.50/0.59 c # maximal number of separation rounds in the root node (-1: unlimited)
0.50/0.59 c # [type: int, range: [-1,2147483647], default: -1]
0.50/0.59 c separating/maxroundsroot = c 5
0.50/0.59 c # maximal number of separation rounds per node (-1: unlimited)
0.50/0.59 c # [type: int, range: [-1,2147483647], default: 5]
0.50/0.59 c separating/maxrounds = c 1
0.50/0.59 c # solving stops, if the given number of solutions were found (-1: no limit)
0.50/0.59 c # [type: int, range: [-1,2147483647], default: -1]
0.50/0.59 c limits/solutions = c 1
0.50/0.59 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.50/0.59 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.50/0.59 c limits/memory = c 1620
0.50/0.59 c # maximal time in seconds to run
0.50/0.59 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.50/0.59 c limits/time = c 1791
0.50/0.59 c # frequency for displaying node information lines
0.50/0.59 c # [type: int, range: [-1,2147483647], default: 100]
0.50/0.59 c display/freq = c 10000
0.50/0.59 c -----------------------------------------------------------------------------------------------
0.50/0.59 c start solving problem
0.50/0.59 c
0.79/0.81 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.79/0.81 c 0.6s| 1 | 0 | 1082 | 24M| 0 | 598 |3237 |9206 |9206 |3237 |9206 | 0 | 0 | 0 | 3.287649e+02 | -- | Inf
1.39/1.47 c 1.2s| 1 | 0 | 1457 | 24M| 0 | 646 |3237 |9206 |9206 |3237 |9261 | 55 | 0 | 0 | 3.634276e+02 | -- | Inf
1.89/1.92 c 1.6s| 1 | 0 | 1882 | 24M| 0 | 695 |3237 |9206 |9206 |3237 |9386 | 180 | 0 | 0 | 3.778607e+02 | -- | Inf
2.59/2.68 c 2.4s| 1 | 0 | 2506 | 25M| 0 | 726 |3237 |9206 |9206 |3237 |9468 | 262 | 0 | 0 | 3.955601e+02 | -- | Inf
3.49/3.57 c 3.3s| 1 | 0 | 3214 | 26M| 0 | 750 |3237 |9206 |9206 |3237 |9539 | 333 | 0 | 0 | 4.030469e+02 | -- | Inf
4.59/4.61 c 4.3s| 1 | 0 | 3821 | 26M| 0 | 735 |3237 |9206 |9206 |3237 |9604 | 398 | 0 | 0 | 4.087340e+02 | -- | Inf
10.59/10.68 c 10.4s| 1 | 2 | 3821 | 26M| 0 | 735 |3237 |9206 |9206 |3237 |9604 | 398 | 0 | 17 | 4.087340e+02 | -- | Inf
203.73/203.87 c
203.73/203.87 c SCIP Status : problem is solved [infeasible]
203.73/203.87 c Solving Time (sec) : 202.58
203.73/203.87 c Solving Nodes : 2028
203.73/203.87 c Primal Bound : +1.00000000000000e+20 (0 solutions)
203.73/203.87 c Dual Bound : +1.00000000000000e+20
203.73/203.87 c Gap : 0.00 %
203.73/203.87 c NODE 2028
203.73/203.87 c DUAL BOUND 1e+20
203.73/203.87 c PRIMAL BOUND 1e+20
203.73/203.87 c GAP 0
203.73/203.87 s UNSATISFIABLE
203.73/203.87 c SCIP Status : problem is solved [infeasible]
203.73/203.87 c Solving Time : 202.58
203.73/203.87 c Original Problem :
203.73/203.87 c Problem name : HOME/instance-1868609-1245129130.opb
203.73/203.87 c Variables : 3736 (3736 binary, 0 integer, 0 implicit integer, 0 continuous)
203.73/203.87 c Constraints : 10457 initial, 10457 maximal
203.73/203.87 c Presolved Problem :
203.73/203.87 c Problem name : t_HOME/instance-1868609-1245129130.opb
203.73/203.87 c Variables : 3237 (3237 binary, 0 integer, 0 implicit integer, 0 continuous)
203.73/203.87 c Constraints : 9206 initial, 9895 maximal
203.73/203.87 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
203.73/203.87 c trivial : 0.01 0 0 0 0 0 0 0 0
203.73/203.87 c dualfix : 0.00 0 0 0 0 0 0 0 0
203.73/203.87 c boundshift : 0.00 0 0 0 0 0 0 0 0
203.73/203.87 c inttobinary : 0.00 0 0 0 0 0 0 0 0
203.73/203.87 c implics : 0.05 0 304 0 0 0 0 0 0
203.73/203.87 c probing : 0.00 0 0 0 0 0 0 0 0
203.73/203.87 c knapsack : 0.02 0 0 0 0 0 0 0 0
203.73/203.87 c linear : 0.21 192 3 0 192 0 1251 184 460
203.73/203.87 c logicor : 0.04 0 0 0 0 0 0 0 0
203.73/203.87 c root node : - 0 - - 0 - - - -
203.73/203.87 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
203.73/203.87 c integral : 0 0 0 1102 0 11 112 0 0 2130
203.73/203.87 c knapsack : 368 5 31569 0 0 3 585 761 0 0
203.73/203.87 c logicor : 8838+ 5 31086 0 0 230 198742 0 0 0
203.73/203.87 c countsols : 0 0 0 0 0 0 0 0 0 0
203.73/203.87 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
203.73/203.87 c integral : 100.98 0.00 0.00 100.98 0.00
203.73/203.87 c knapsack : 0.72 0.01 0.71 0.00 0.00
203.73/203.87 c logicor : 1.64 0.00 1.64 0.00 0.00
203.73/203.87 c countsols : 0.00 0.00 0.00 0.00 0.00
203.73/203.87 c Propagators : Time Calls Cutoffs DomReds
203.73/203.87 c rootredcost : 0.02 0 0 0
203.73/203.87 c pseudoobj : 5.21 31649 0 0
203.73/203.87 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
203.73/203.87 c propagation : 0.06 233 212 1455 32.9 35 12.8 -
203.73/203.87 c infeasible LP : 0.52 789 0 0 0.0 0 0.0 0
203.73/203.87 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
203.73/203.87 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
203.73/203.87 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
203.73/203.87 c applied globally : - - - 940 28.7 - - -
203.73/203.87 c applied locally : - - - 0 0.0 - - -
203.73/203.87 c Separators : Time Calls Cutoffs DomReds Cuts Conss
203.73/203.87 c cut pool : 0.00 4 - - 405 - (maximal pool size: 2062)
203.73/203.87 c redcost : 0.33 1088 0 0 0 0
203.73/203.87 c impliedbounds : 0.01 5 0 0 0 0
203.73/203.87 c intobj : 0.00 0 0 0 0 0
203.73/203.87 c gomory : 0.97 5 0 0 2500 0
203.73/203.87 c strongcg : 0.68 5 0 0 2500 0
203.73/203.87 c cmir : 0.00 0 0 0 0 0
203.73/203.87 c flowcover : 0.00 0 0 0 0 0
203.73/203.87 c clique : 0.25 5 0 0 36 0
203.73/203.87 c zerohalf : 0.00 0 0 0 0 0
203.73/203.87 c mcf : 0.03 1 0 0 0 0
203.73/203.87 c Pricers : Time Calls Vars
203.73/203.87 c problem variables: 0.00 0 0
203.73/203.87 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
203.73/203.87 c relpscost : 100.96 1102 11 112 0 0 2130
203.73/203.87 c pscost : 0.00 0 0 0 0 0 0
203.73/203.87 c inference : 0.00 0 0 0 0 0 0
203.73/203.87 c mostinf : 0.00 0 0 0 0 0 0
203.73/203.87 c leastinf : 0.00 0 0 0 0 0 0
203.73/203.87 c fullstrong : 0.00 0 0 0 0 0 0
203.73/203.87 c allfullstrong : 0.00 0 0 0 0 0 0
203.73/203.87 c random : 0.00 0 0 0 0 0 0
203.73/203.87 c Primal Heuristics : Time Calls Found
203.73/203.87 c LP solutions : 0.00 - 0
203.73/203.87 c pseudo solutions : 0.00 - 0
203.73/203.87 c simplerounding : 0.00 0 0
203.73/203.87 c rounding : 0.00 0 0
203.73/203.87 c shifting : 0.00 0 0
203.73/203.87 c intshifting : 0.00 0 0
203.73/203.87 c oneopt : 0.00 0 0
203.73/203.87 c fixandinfer : 0.00 0 0
203.73/203.87 c feaspump : 0.00 0 0
203.73/203.87 c coefdiving : 0.00 0 0
203.73/203.87 c pscostdiving : 0.00 0 0
203.73/203.87 c fracdiving : 0.00 0 0
203.73/203.87 c veclendiving : 0.00 0 0
203.73/203.87 c intdiving : 0.00 0 0
203.73/203.87 c actconsdiving : 0.00 0 0
203.73/203.87 c objpscostdiving : 0.00 0 0
203.73/203.87 c rootsoldiving : 0.00 0 0
203.73/203.87 c linesearchdiving : 0.00 0 0
203.73/203.87 c guideddiving : 0.00 0 0
203.73/203.87 c octane : 0.00 0 0
203.73/203.87 c rens : 0.00 0 0
203.73/203.87 c rins : 0.00 0 0
203.73/203.87 c localbranching : 0.00 0 0
203.73/203.87 c mutation : 0.00 0 0
203.73/203.87 c crossover : 0.00 0 0
203.73/203.87 c dins : 0.00 0 0
203.73/203.87 c LP : Time Calls Iterations Iter/call Iter/sec
203.73/203.87 c primal LP : 0.10 0 0 0.00 0.00
203.73/203.87 c dual LP : 83.46 1644 153355 93.28 1837.47
203.73/203.87 c barrier LP : 0.00 0 0 0.00 -
203.73/203.87 c diving/probing LP: 0.00 0 0 0.00 -
203.73/203.87 c strong branching : 100.69 693 183694 265.07 1824.35
203.73/203.87 c (at root node) : - 17 7104 417.88 -
203.73/203.87 c conflict analysis: 0.00 0 0 0.00 -
203.73/203.87 c B&B Tree :
203.73/203.87 c number of runs : 1
203.73/203.87 c nodes : 2028
203.73/203.87 c nodes (total) : 2028
203.73/203.87 c nodes left : 0
203.73/203.87 c max depth : 60
203.73/203.87 c max depth (total): 60
203.73/203.87 c backtracks : 590 (29.1%)
203.73/203.87 c delayed cutoffs : 103
203.73/203.87 c repropagations : 612 (17741 domain reductions, 70 cutoffs)
203.73/203.87 c avg switch length: 5.56
203.73/203.87 c switching time : 1.90
203.73/203.87 c Solution :
203.73/203.87 c Solutions found : 0 (0 improvements)
203.73/203.87 c Primal Bound : infeasible
203.73/203.87 c Dual Bound : -
203.73/203.87 c Gap : 0.00 %
203.73/203.87 c Root Dual Bound : +4.08733953783754e+02
203.83/203.94 c Time complete: 203.88.