0.00/0.05 c SCIP version 1.1.0.7
0.00/0.05 c LP-Solver Clp 1.8.2
0.00/0.05 c user parameter file <scip.set> not found - using default parameters
0.00/0.05 c read problem <HOME/instance-1868207-1245115961.opb>
0.00/0.05 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.00/0.06 c No objective function, only one solution is needed.
0.00/0.06 c start presolving problem
0.00/0.06 c presolving:
0.09/0.10 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.11 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.12 c presolving (3 rounds):
0.09/0.12 c 0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.12 c 242 implications, 22 cliques
0.09/0.12 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2564 constraints
0.09/0.12 c 1 constraints of type <knapsack>
0.09/0.12 c 22 constraints of type <setppc>
0.09/0.12 c 2541 constraints of type <logicor>
0.09/0.12 c transformed objective value is always integral (scale: 1)
0.09/0.12 c Presolving Time: 0.06
0.09/0.12 c SATUNSAT-LIN
0.09/0.12 c -----------------------------------------------------------------------------------------------
0.09/0.12 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c separating/flowcover/freq = c -1
0.09/0.12 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c separating/cmir/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/veclendiving/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/veclendiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <veclendiving> (-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/veclendiving/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c heuristics/simplerounding/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <shifting> (-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/shifting/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c heuristics/rounding/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/rootsoldiving/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.01]
0.09/0.12 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.09/0.12 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12 c heuristics/rootsoldiving/freq = c -1
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/rens/nodesofs = c 2000
0.09/0.12 c # minimum percentage of integer variables that have to be fixable
0.09/0.12 c # [type: real, range: [0,1], default: 0.5]
0.09/0.12 c heuristics/rens/minfixingrate = c 0.3
0.09/0.12 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c heuristics/rens/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/pscostdiving/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/pscostdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <pscostdiving> (-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/pscostdiving/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c heuristics/oneopt/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/objpscostdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.12 c # [type: real, range: [0,1], default: 0.01]
0.09/0.12 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.09/0.12 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12 c heuristics/objpscostdiving/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/linesearchdiving/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/linesearchdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <linesearchdiving> (-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/linesearchdiving/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <intshifting> (-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/intshifting/freq = c -1
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/intdiving/maxlpiterquot = c 0.075
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/guideddiving/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/guideddiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <guideddiving> (-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/guideddiving/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/fracdiving/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/fracdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <fracdiving> (-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/fracdiving/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/feaspump/maxlpiterofs = c 2000
0.09/0.12 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12 c heuristics/feaspump/freq = c -1
0.09/0.12 c # minimum percentage of integer variables that have to be fixed
0.09/0.12 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 | 60 |3513k| 0 | 22 | 231 |2564 |2564 | 231 |2564 | 0 | 0 | 0 | 1.100000e+01 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 82 |3570k| 0 | 33 | 231 |2564 |2564 | 231 |2569 | 5 | 0 | 0 | 1.100000e+01 | -- | Inf
0.39/0.41 c 0.3s| 1 | 0 | 123 |4002k| 0 | 38 | 231 |2564 |2564 | 231 |2574 | 10 | 0 | 0 | 1.100000e+01 | -- | Inf
0.59/0.69 c 0.6s| 1 | 0 | 275 |4413k| 0 | 36 | 231 |2564 |2564 | 231 |2578 | 14 | 0 | 0 | 1.100000e+01 | -- | Inf
2.19/2.21 c 2.1s| 1 | 2 | 275 |4413k| 0 | 36 | 231 |2564 |2564 | 231 |2578 | 14 | 0 | 18 | 1.100000e+01 | -- | Inf
144.43/144.51 c 144s| 10000 | 1252 |378082 |7694k| 63 | - | 231 |3063 |1303 | 231 |2571 | 14 |1092 |2058 | 1.400000e+01 | -- | Inf
241.51/241.69 c 240s| 20000 | 1778 |711133 |9094k| 63 | - | 231 |2995 |1239 | 0 | 0 | 14 |2148 |2252 | 1.500000e+01 | -- | Inf
347.28/347.44 c 345s| 30000 | 2208 | 1040k| 10M| 64 | - | 231 |3002 |1559 | 231 |2571 | 14 |2922 |2925 | 1.500000e+01 | -- | Inf
447.35/447.53 c 445s| 40000 | 2236 | 1354k| 10M| 65 | 14 | 231 |3175 |1188 | 231 |2571 | 14 |3913 |3400 | 1.500000e+01 | -- | Inf
542.62/542.85 c 540s| 50000 | 2055 | 1647k| 10M| 65 | 21 | 231 |3278 |1587 | 231 |2571 | 14 |5090 |3833 | 1.600000e+01 | -- | Inf
632.39/632.69 c 629s| 60000 | 1536 | 1908k|9700k| 65 | - | 231 |3258 |1278 | 231 |2571 | 14 |6159 |4264 | 1.700000e+01 | -- | Inf
715.17/715.46 c 711s| 70000 | 946 | 2129k|8458k| 65 | 24 | 231 |3112 | 972 | 231 |2571 | 14 |6953 |4674 | 1.700000e+01 | -- | Inf
762.45/762.75 c
762.45/762.75 c SCIP Status : problem is solved [infeasible]
762.45/762.75 c Solving Time (sec) : 758.19
762.45/762.75 c Solving Nodes : 76522
762.45/762.75 c Primal Bound : +1.00000000000000e+20 (0 solutions)
762.45/762.75 c Dual Bound : +1.00000000000000e+20
762.45/762.75 c Gap : 0.00 %
762.45/762.75 c NODE 76522
762.45/762.75 c DUAL BOUND 1e+20
762.45/762.75 c PRIMAL BOUND 1e+20
762.45/762.75 c GAP 0
762.45/762.75 s UNSATISFIABLE
762.45/762.75 c SCIP Status : problem is solved [infeasible]
762.45/762.75 c Solving Time : 758.19
762.45/762.75 c Original Problem :
762.45/762.75 c Problem name : HOME/instance-1868207-1245115961.opb
762.45/762.75 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
762.45/762.75 c Constraints : 2707 initial, 2707 maximal
762.45/762.75 c Presolved Problem :
762.45/762.75 c Problem name : t_HOME/instance-1868207-1245115961.opb
762.45/762.75 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
762.45/762.75 c Constraints : 2564 initial, 3344 maximal
762.45/762.75 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
762.45/762.75 c trivial : 0.00 0 0 0 0 0 0 0 0
762.45/762.75 c dualfix : 0.00 0 0 0 0 0 0 0 0
762.45/762.75 c boundshift : 0.00 0 0 0 0 0 0 0 0
762.45/762.75 c inttobinary : 0.00 0 0 0 0 0 0 0 0
762.45/762.75 c implics : 0.00 0 0 0 0 0 0 0 0
762.45/762.75 c probing : 0.00 0 0 0 0 0 0 0 0
762.45/762.75 c knapsack : 0.00 0 0 0 0 0 0 0 0
762.45/762.75 c setppc : 0.00 0 0 0 0 0 0 0 0
762.45/762.75 c linear : 0.03 0 0 0 0 0 143 0 0
762.45/762.75 c logicor : 0.03 0 0 0 0 0 0 0 0
762.45/762.75 c root node : - 1 - - 1 - - - -
762.45/762.75 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
762.45/762.75 c integral : 0 0 0 39604 0 239 1858 0 0 76648
762.45/762.75 c knapsack : 1 4 168740 0 0 642 198010 0 0 0
762.45/762.75 c setppc : 22 4 168413 0 0 1967 379712 0 0 0
762.45/762.75 c logicor : 2541+ 4 145728 0 0 614 499822 0 0 0
762.45/762.75 c countsols : 0 0 0 0 0 0 0 0 0 0
762.45/762.75 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
762.45/762.75 c integral : 85.51 0.00 0.00 85.51 0.00
762.45/762.75 c knapsack : 0.72 0.00 0.72 0.00 0.00
762.45/762.75 c setppc : 1.99 0.00 1.99 0.00 0.00
762.45/762.75 c logicor : 11.32 0.00 11.32 0.00 0.00
762.45/762.75 c countsols : 0.00 0.00 0.00 0.00 0.00
762.45/762.75 c Propagators : Time Calls Cutoffs DomReds
762.45/762.75 c rootredcost : 0.15 0 0 0
762.45/762.75 c pseudoobj : 2.36 169072 1 0
762.45/762.75 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
762.45/762.75 c propagation : 0.30 3223 3222 15880 18.6 47 14.9 -
762.45/762.75 c infeasible LP : 1.32 34862 0 0 0.0 0 0.0 0
762.45/762.75 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
762.45/762.75 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
762.45/762.75 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
762.45/762.75 c applied globally : - - - 7598 15.9 - - -
762.45/762.75 c applied locally : - - - 16 34.1 - - -
762.45/762.75 c Separators : Time Calls Cutoffs DomReds Cuts Conss
762.45/762.75 c cut pool : 0.00 3 - - 6 - (maximal pool size: 300)
762.45/762.75 c redcost : 0.74 38632 0 0 0 0
762.45/762.75 c impliedbounds : 0.00 4 0 0 0 0
762.45/762.75 c intobj : 0.00 0 0 0 0 0
762.45/762.75 c gomory : 0.39 4 0 0 1500 0
762.45/762.75 c strongcg : 0.33 4 0 0 1500 0
762.45/762.75 c cmir : 0.00 0 0 0 0 0
762.45/762.75 c flowcover : 0.00 0 0 0 0 0
762.45/762.76 c clique : 0.00 4 0 0 0 0
762.45/762.76 c zerohalf : 0.00 0 0 0 0 0
762.45/762.76 c mcf : 0.00 1 0 0 0 0
762.45/762.76 c Pricers : Time Calls Vars
762.45/762.76 c problem variables: 0.00 0 0
762.45/762.76 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
762.45/762.76 c relpscost : 85.41 39604 239 1858 0 0 76648
762.45/762.76 c pscost : 0.00 0 0 0 0 0 0
762.45/762.76 c inference : 0.00 0 0 0 0 0 0
762.45/762.76 c mostinf : 0.00 0 0 0 0 0 0
762.45/762.76 c leastinf : 0.00 0 0 0 0 0 0
762.45/762.76 c fullstrong : 0.00 0 0 0 0 0 0
762.45/762.76 c allfullstrong : 0.00 0 0 0 0 0 0
762.45/762.76 c random : 0.00 0 0 0 0 0 0
762.45/762.76 c Primal Heuristics : Time Calls Found
762.45/762.76 c LP solutions : 0.00 - 0
762.45/762.76 c pseudo solutions : 0.00 - 0
762.45/762.76 c simplerounding : 0.00 0 0
762.45/762.76 c rounding : 0.00 0 0
762.45/762.76 c shifting : 0.00 0 0
762.45/762.76 c intshifting : 0.00 0 0
762.45/762.76 c oneopt : 0.00 0 0
762.45/762.76 c fixandinfer : 0.00 0 0
762.45/762.76 c feaspump : 0.00 0 0
762.45/762.76 c coefdiving : 0.00 0 0
762.45/762.76 c pscostdiving : 0.00 0 0
762.45/762.76 c fracdiving : 0.00 0 0
762.45/762.76 c veclendiving : 0.00 0 0
762.45/762.76 c intdiving : 0.00 0 0
762.45/762.76 c actconsdiving : 0.00 0 0
762.45/762.76 c objpscostdiving : 0.00 0 0
762.45/762.76 c rootsoldiving : 0.00 0 0
762.45/762.76 c linesearchdiving : 0.00 0 0
762.45/762.76 c guideddiving : 0.00 0 0
762.45/762.76 c octane : 0.00 0 0
762.45/762.76 c rens : 0.00 0 0
762.45/762.76 c rins : 0.00 0 0
762.45/762.76 c localbranching : 0.00 0 0
762.45/762.76 c mutation : 0.00 0 0
762.45/762.76 c crossover : 0.00 0 0
762.45/762.76 c dins : 0.00 0 0
762.45/762.76 c LP : Time Calls Iterations Iter/call Iter/sec
762.45/762.76 c primal LP : 0.01 0 0 0.00 0.00
762.45/762.76 c dual LP : 614.21 74175 2234556 30.13 3638.10
762.45/762.76 c barrier LP : 0.00 0 0 0.00 -
762.45/762.76 c diving/probing LP: 0.00 0 0 0.00 -
762.45/762.76 c strong branching : 83.85 5016 336398 67.06 4011.90
762.45/762.76 c (at root node) : - 18 4101 227.83 -
762.45/762.76 c conflict analysis: 0.00 0 0 0.00 -
762.45/762.76 c B&B Tree :
762.45/762.76 c number of runs : 1
762.45/762.76 c nodes : 76522
762.45/762.76 c nodes (total) : 76522
762.45/762.76 c nodes left : 0
762.45/762.76 c max depth : 65
762.45/762.76 c max depth (total): 65
762.45/762.76 c backtracks : 9326 (12.2%)
762.45/762.76 c delayed cutoffs : 127
762.45/762.76 c repropagations : 8023 (19319 domain reductions, 127 cutoffs)
762.45/762.76 c avg switch length: 5.47
762.45/762.76 c switching time : 13.20
762.45/762.76 c Solution :
762.45/762.76 c Solutions found : 0 (0 improvements)
762.45/762.76 c Primal Bound : infeasible
762.45/762.76 c Dual Bound : -
762.45/762.76 c Gap : 0.00 %
762.45/762.76 c Root Dual Bound : +1.10000000000000e+01
762.45/762.77 c Time complete: 762.53.