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-1868327-1245121163.opb>
0.00/0.04 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.00/0.05 c No objective function, only one solution is needed.
0.00/0.05 c start presolving problem
0.00/0.05 c presolving:
0.00/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.09/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.09/0.11 c presolving (3 rounds):
0.09/0.11 c 0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.11 c 242 implications, 22 cliques
0.09/0.11 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2564 constraints
0.09/0.11 c 1 constraints of type <knapsack>
0.09/0.11 c 22 constraints of type <setppc>
0.09/0.11 c 2541 constraints of type <logicor>
0.09/0.11 c transformed objective value is always integral (scale: 1)
0.09/0.11 c Presolving Time: 0.06
0.09/0.11 c SATUNSAT-LIN
0.09/0.11 c -----------------------------------------------------------------------------------------------
0.09/0.11 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.11 c separating/flowcover/freq = c -1
0.09/0.11 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.11 c separating/cmir/freq = c -1
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/veclendiving/maxlpiterofs = c 1500
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.11 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.09/0.11 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/veclendiving/freq = c -1
0.09/0.11 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.11 c heuristics/simplerounding/freq = c -1
0.09/0.11 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/shifting/freq = c -1
0.09/0.11 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.11 c heuristics/rounding/freq = c -1
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.11 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.09/0.11 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.11 c heuristics/rootsoldiving/freq = c -1
0.09/0.11 c # number of nodes added to the contingent of the total nodes
0.09/0.11 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.11 c heuristics/rens/nodesofs = c 2000
0.09/0.11 c # minimum percentage of integer variables that have to be fixable
0.09/0.11 c # [type: real, range: [0,1], default: 0.5]
0.09/0.11 c heuristics/rens/minfixingrate = c 0.3
0.09/0.11 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.11 c heuristics/rens/freq = c -1
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.11 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.09/0.11 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/pscostdiving/freq = c -1
0.09/0.11 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.11 c heuristics/oneopt/freq = c -1
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.09/0.11 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.11 c # [type: real, range: [0,1], default: 0.01]
0.09/0.11 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.09/0.11 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.11 c heuristics/objpscostdiving/freq = c -1
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.11 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.09/0.11 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/linesearchdiving/freq = c -1
0.09/0.11 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/intshifting/freq = c -1
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.11 c heuristics/intdiving/maxlpiterquot = c 0.075
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/guideddiving/maxlpiterofs = c 1500
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.11 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.09/0.11 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/guideddiving/freq = c -1
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/fracdiving/maxlpiterofs = c 1500
0.09/0.11 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.11 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.09/0.11 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.11 c heuristics/fracdiving/freq = c -1
0.09/0.11 c # additional number of allowed LP iterations
0.09/0.11 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.11 c heuristics/feaspump/maxlpiterofs = c 2000
0.09/0.11 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.11 c heuristics/feaspump/freq = c -1
0.09/0.11 c # minimum percentage of integer variables that have to be fixed
0.09/0.11 c # [type: real, range: [0,1], default: 0.666]
0.09/0.12 c heuristics/crossover/minfixingrate = c 0.5
0.09/0.12 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.12 c # [type: real, range: [0,1], default: 0.1]
0.09/0.12 c heuristics/crossover/nodesquot = c 0.15
0.09/0.12 c # number of nodes without incumbent change that heuristic should wait
0.09/0.12 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.12 c heuristics/crossover/nwaitingnodes = c 100
0.09/0.12 c # number of nodes added to the contingent of the total nodes
0.09/0.12 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.12 c heuristics/crossover/nodesofs = c 750
0.09/0.12 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.12 c heuristics/crossover/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/coefdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/coefdiving/freq = c -1
0.09/0.12 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c presolving/probing/maxrounds = c 0
0.09/0.12 c # should presolving try to simplify knapsacks
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/knapsack/simplifyinequalities = c TRUE
0.09/0.12 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.12 c constraints/knapsack/disaggregation = c FALSE
0.09/0.12 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c constraints/knapsack/maxnumcardlift = c 0
0.09/0.12 c # should presolving try to simplify inequalities
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/linear/simplifyinequalities = c TRUE
0.09/0.12 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c separating/maxroundsroot = c 5
0.09/0.12 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.12 c separating/maxrounds = c 1
0.09/0.12 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c limits/solutions = c 1
0.09/0.12 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/memory = c 1620
0.09/0.12 c # maximal time in seconds to run
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/time = c 1791
0.09/0.12 c # frequency for displaying node information lines
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.12 c display/freq = c 10000
0.09/0.12 c -----------------------------------------------------------------------------------------------
0.09/0.12 c start solving problem
0.09/0.12 c
0.09/0.14 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.14 c 0.1s| 1 | 0 | 59 |3513k| 0 | 36 | 231 |2564 |2564 | 231 |2564 | 0 | 0 | 0 | 1.100000e+01 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 109 |3689k| 0 | 45 | 231 |2564 |2564 | 231 |2571 | 7 | 0 | 0 | 1.100000e+01 | -- | Inf
0.39/0.42 c 0.3s| 1 | 0 | 316 |3903k| 0 | 52 | 231 |2564 |2564 | 231 |2579 | 15 | 0 | 0 | 1.100000e+01 | -- | Inf
0.49/0.55 c 0.5s| 1 | 0 | 422 |4065k| 0 | 51 | 231 |2564 |2564 | 231 |2584 | 20 | 0 | 0 | 1.100000e+01 | -- | Inf
0.69/0.70 c 0.6s| 1 | 0 | 570 |4251k| 0 | 48 | 231 |2564 |2564 | 231 |2589 | 25 | 0 | 0 | 1.100000e+01 | -- | Inf
0.79/0.83 c 0.8s| 1 | 0 | 615 |4446k| 0 | 55 | 231 |2564 |2564 | 231 |2593 | 29 | 0 | 0 | 1.100000e+01 | -- | Inf
1.80/1.81 c 1.7s| 1 | 2 | 615 |4447k| 0 | 55 | 231 |2564 |2564 | 231 |2593 | 29 | 0 | 19 | 1.100000e+01 | -- | Inf
142.79/142.94 c 142s| 10000 | 969 |368505 |7097k| 57 | - | 231 |3007 |1228 | 231 |2570 | 29 |1095 |2021 | 1.400000e+01 | -- | Inf
246.25/246.43 c 245s| 20000 | 1223 |706872 |7923k| 57 | 34 | 231 |3031 |1573 | 231 |2570 | 29 |2328 |2528 | 1.500000e+01 | -- | Inf
350.52/350.77 c 349s| 30000 | 1329 | 1037k|8518k| 57 | - | 231 |2799 |1676 | 231 |2570 | 29 |3084 |3028 | 1.500000e+01 | -- | Inf
447.59/447.87 c 445s| 40000 | 1015 | 1328k|8047k| 57 | 28 | 231 |3133 |1725 | 231 |2570 | 29 |4340 |3584 | 1.600000e+01 | -- | Inf
533.97/534.27 c 531s| 50000 | 25 | 1570k|4963k| 57 | 14 | 231 |2824 |1074 | 231 |2570 | 29 |5322 |3982 | 1.800000e+01 | -- | Inf
534.26/534.57 c
534.26/534.57 c SCIP Status : problem is solved [infeasible]
534.26/534.57 c Solving Time (sec) : 531.52
534.26/534.57 c Solving Nodes : 50039
534.26/534.57 c Primal Bound : +1.00000000000000e+20 (0 solutions)
534.26/534.57 c Dual Bound : +1.00000000000000e+20
534.26/534.57 c Gap : 0.00 %
534.26/534.57 c NODE 50039
534.26/534.57 c DUAL BOUND 1e+20
534.26/534.57 c PRIMAL BOUND 1e+20
534.26/534.57 c GAP 0
534.26/534.57 s UNSATISFIABLE
534.26/534.57 c SCIP Status : problem is solved [infeasible]
534.26/534.57 c Solving Time : 531.52
534.26/534.57 c Original Problem :
534.26/534.57 c Problem name : HOME/instance-1868327-1245121163.opb
534.26/534.57 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
534.26/534.57 c Constraints : 2707 initial, 2707 maximal
534.26/534.57 c Presolved Problem :
534.26/534.57 c Problem name : t_HOME/instance-1868327-1245121163.opb
534.26/534.57 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
534.26/534.57 c Constraints : 2564 initial, 3192 maximal
534.26/534.57 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
534.26/534.57 c trivial : 0.00 0 0 0 0 0 0 0 0
534.26/534.57 c dualfix : 0.00 0 0 0 0 0 0 0 0
534.26/534.57 c boundshift : 0.00 0 0 0 0 0 0 0 0
534.26/534.57 c inttobinary : 0.00 0 0 0 0 0 0 0 0
534.26/534.57 c implics : 0.00 0 0 0 0 0 0 0 0
534.26/534.57 c probing : 0.00 0 0 0 0 0 0 0 0
534.26/534.57 c knapsack : 0.00 0 0 0 0 0 0 0 0
534.26/534.57 c setppc : 0.00 0 0 0 0 0 0 0 0
534.26/534.57 c linear : 0.03 0 0 0 0 0 143 0 0
534.26/534.57 c logicor : 0.03 0 0 0 0 0 0 0 0
534.26/534.57 c root node : - 24 - - 24 - - - -
534.26/534.57 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
534.26/534.57 c integral : 0 0 0 26048 0 169 1508 0 0 50134
534.26/534.57 c knapsack : 1 5 107442 0 0 417 170399 0 0 0
534.26/534.57 c setppc : 22 5 107206 0 0 1499 267908 0 0 0
534.26/534.57 c logicor : 2541+ 5 92115 0 0 445 314033 0 0 0
534.26/534.57 c countsols : 0 0 0 0 0 0 0 0 0 0
534.26/534.57 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
534.26/534.57 c integral : 73.66 0.00 0.00 73.66 0.00
534.26/534.57 c knapsack : 0.49 0.00 0.49 0.00 0.00
534.26/534.57 c setppc : 0.94 0.00 0.94 0.00 0.00
534.26/534.57 c logicor : 7.11 0.00 7.11 0.00 0.00
534.26/534.57 c countsols : 0.00 0.00 0.00 0.00 0.00
534.26/534.57 c Propagators : Time Calls Cutoffs DomReds
534.26/534.57 c rootredcost : 0.06 0 0 0
534.26/534.57 c pseudoobj : 1.46 107640 1 0
534.26/534.57 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
534.26/534.57 c propagation : 0.12 2361 2361 10960 16.0 16 15.4 -
534.26/534.57 c infeasible LP : 0.60 22537 0 0 0.0 0 0.0 0
534.26/534.57 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
534.26/534.57 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
534.26/534.57 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
534.26/534.57 c applied globally : - - - 5320 14.5 - - -
534.26/534.57 c applied locally : - - - 3 34.7 - - -
534.26/534.57 c Separators : Time Calls Cutoffs DomReds Cuts Conss
534.26/534.57 c cut pool : 0.00 4 - - 0 - (maximal pool size: 469)
534.26/534.57 c redcost : 0.34 25295 0 0 0 0
534.26/534.57 c impliedbounds : 0.00 5 0 0 0 0
534.26/534.57 c intobj : 0.00 0 0 0 0 0
534.26/534.57 c gomory : 0.27 5 0 0 2500 0
534.26/534.57 c strongcg : 0.25 5 0 0 2500 0
534.26/534.57 c cmir : 0.00 0 0 0 0 0
534.26/534.57 c flowcover : 0.00 0 0 0 0 0
534.26/534.57 c clique : 0.00 5 0 0 0 0
534.26/534.57 c zerohalf : 0.00 0 0 0 0 0
534.26/534.57 c mcf : 0.01 1 0 0 0 0
534.26/534.57 c Pricers : Time Calls Vars
534.26/534.57 c problem variables: 0.00 0 0
534.26/534.57 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
534.26/534.57 c relpscost : 73.64 26048 169 1508 0 0 50134
534.26/534.57 c pscost : 0.00 0 0 0 0 0 0
534.26/534.57 c inference : 0.00 0 0 0 0 0 0
534.26/534.57 c mostinf : 0.00 0 0 0 0 0 0
534.26/534.57 c leastinf : 0.00 0 0 0 0 0 0
534.26/534.57 c fullstrong : 0.00 0 0 0 0 0 0
534.26/534.57 c allfullstrong : 0.00 0 0 0 0 0 0
534.26/534.57 c random : 0.00 0 0 0 0 0 0
534.26/534.57 c Primal Heuristics : Time Calls Found
534.26/534.57 c LP solutions : 0.00 - 0
534.26/534.57 c pseudo solutions : 0.00 - 0
534.26/534.57 c simplerounding : 0.00 0 0
534.26/534.57 c rounding : 0.00 0 0
534.26/534.57 c shifting : 0.00 0 0
534.26/534.57 c intshifting : 0.00 0 0
534.26/534.57 c oneopt : 0.00 0 0
534.26/534.57 c fixandinfer : 0.00 0 0
534.26/534.57 c feaspump : 0.00 0 0
534.26/534.57 c coefdiving : 0.00 0 0
534.26/534.57 c pscostdiving : 0.00 0 0
534.26/534.57 c fracdiving : 0.00 0 0
534.26/534.57 c veclendiving : 0.00 0 0
534.26/534.57 c intdiving : 0.00 0 0
534.26/534.57 c actconsdiving : 0.00 0 0
534.26/534.57 c objpscostdiving : 0.00 0 0
534.26/534.57 c rootsoldiving : 0.00 0 0
534.26/534.57 c linesearchdiving : 0.00 0 0
534.26/534.57 c guideddiving : 0.00 0 0
534.26/534.57 c octane : 0.00 0 0
534.26/534.57 c rens : 0.00 0 0
534.26/534.57 c rins : 0.00 0 0
534.26/534.57 c localbranching : 0.00 0 0
534.26/534.57 c mutation : 0.00 0 0
534.26/534.57 c crossover : 0.00 0 0
534.26/534.57 c dins : 0.00 0 0
534.26/534.57 c LP : Time Calls Iterations Iter/call Iter/sec
534.26/534.57 c primal LP : 0.01 0 0 0.00 0.00
534.26/534.57 c dual LP : 421.76 48445 1571143 32.43 3725.21
534.26/534.57 c barrier LP : 0.00 0 0 0.00 -
534.26/534.57 c diving/probing LP: 0.00 0 0 0.00 -
534.26/534.57 c strong branching : 72.58 3982 290724 73.01 4005.57
534.26/534.57 c (at root node) : - 19 3109 163.63 -
534.26/534.57 c conflict analysis: 0.00 0 0 0.00 -
534.26/534.57 c B&B Tree :
534.26/534.57 c number of runs : 1
534.26/534.57 c nodes : 50039
534.26/534.57 c nodes (total) : 50039
534.26/534.57 c nodes left : 0
534.26/534.57 c max depth : 57
534.26/534.57 c max depth (total): 57
534.26/534.57 c backtracks : 5553 (11.1%)
534.26/534.57 c delayed cutoffs : 96
534.26/534.57 c repropagations : 5689 (12050 domain reductions, 96 cutoffs)
534.26/534.57 c avg switch length: 5.05
534.26/534.57 c switching time : 8.07
534.26/534.57 c Solution :
534.26/534.57 c Solutions found : 0 (0 improvements)
534.26/534.57 c Primal Bound : infeasible
534.26/534.57 c Dual Bound : -
534.26/534.57 c Gap : 0.00 %
534.26/534.57 c Root Dual Bound : +1.10000000000000e+01
534.26/534.59 c Time complete: 534.36.