0.02/0.05 c SCIP version 1.1.0.7
0.02/0.05 c LP-Solver Clp 1.8.2
0.02/0.05 c user parameter file <scip.set> not found - using default parameters
0.02/0.05 c read problem <HOME/instance-1868297-1245119930.opb>
0.02/0.05 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.02/0.06 c No objective function, only one solution is needed.
0.02/0.06 c start presolving problem
0.02/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.05
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.15 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.15 c 0.1s| 1 | 0 | 67 |3513k| 0 | 36 | 231 |2564 |2564 | 231 |2564 | 0 | 0 | 0 | 1.100000e+01 | -- | Inf
0.19/0.28 c 0.2s| 1 | 0 | 125 |3720k| 0 | 47 | 231 |2564 |2564 | 231 |2569 | 5 | 0 | 0 | 1.100000e+01 | -- | Inf
0.59/0.67 c 0.6s| 1 | 0 | 232 |3991k| 0 | 54 | 231 |2564 |2564 | 231 |2573 | 9 | 0 | 0 | 1.100000e+01 | -- | Inf
0.79/0.85 c 0.8s| 1 | 0 | 412 |4224k| 0 | 49 | 231 |2564 |2564 | 231 |2578 | 14 | 0 | 0 | 1.100000e+01 | -- | Inf
1.00/1.06 c 1.0s| 1 | 0 | 673 |4435k| 0 | 41 | 231 |2564 |2564 | 231 |2583 | 19 | 0 | 0 | 1.100000e+01 | -- | Inf
1.39/1.42 c 1.3s| 1 | 0 | 921 |4636k| 0 | 32 | 231 |2564 |2564 | 231 |2585 | 21 | 0 | 0 | 1.100000e+01 | -- | Inf
2.20/2.23 c 2.1s| 1 | 2 | 921 |4637k| 0 | 32 | 231 |2564 |2564 | 231 |2585 | 21 | 0 | 20 | 1.100000e+01 | -- | Inf
131.55/131.63 c 131s| 10000 | 1104 |349589 |7686k| 54 | 26 | 231 |3168 |1444 | 231 |2570 | 21 |1250 |2561 | 1.400000e+01 | -- | Inf
215.03/215.19 c 214s| 20000 | 1460 |629429 |8758k| 54 | 16 | 231 |3200 | 770 | 231 |2570 | 21 |2950 |2758 | 1.500000e+01 | -- | Inf
306.21/306.31 c 304s| 30000 | 1839 |908762 |9858k| 56 | 36 | 231 |3025 |1399 | 231 |2570 | 21 |4264 |3465 | 1.500000e+01 | -- | Inf
400.99/401.11 c 399s| 40000 | 2032 | 1198k| 10M| 56 | 27 | 231 |2866 |1016 | 231 |2570 | 21 |4927 |4197 | 1.500000e+01 | -- | Inf
482.27/482.41 c 479s| 50000 | 1828 | 1439k| 10M| 56 | - | 231 |3321 |1360 | 231 |2570 | 21 |6849 |4670 | 1.600000e+01 | -- | Inf
565.74/565.91 c 562s| 60000 | 1593 | 1677k| 10M| 56 | - | 231 |3372 | 863 | 231 |2570 | 21 |8112 |5338 | 1.600000e+01 | -- | Inf
640.04/640.20 c 636s| 70000 | 956 | 1872k|8510k| 58 | 29 | 231 |3311 |1229 | 231 |2570 | 21 |9574 |5833 | 1.700000e+01 | -- | Inf
702.51/702.78 c
702.51/702.78 c SCIP Status : problem is solved [infeasible]
702.51/702.78 c Solving Time (sec) : 698.68
702.51/702.78 c Solving Nodes : 78642
702.51/702.78 c Primal Bound : +1.00000000000000e+20 (0 solutions)
702.51/702.78 c Dual Bound : +1.00000000000000e+20
702.51/702.78 c Gap : 0.00 %
702.51/702.78 c NODE 78642
702.51/702.78 c DUAL BOUND 1e+20
702.51/702.78 c PRIMAL BOUND 1e+20
702.51/702.78 c GAP 0
702.51/702.78 s UNSATISFIABLE
702.51/702.78 c SCIP Status : problem is solved [infeasible]
702.51/702.78 c Solving Time : 698.68
702.51/702.78 c Original Problem :
702.51/702.78 c Problem name : HOME/instance-1868297-1245119930.opb
702.51/702.78 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
702.51/702.78 c Constraints : 2707 initial, 2707 maximal
702.51/702.78 c Presolved Problem :
702.51/702.78 c Problem name : t_HOME/instance-1868297-1245119930.opb
702.51/702.78 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
702.51/702.78 c Constraints : 2564 initial, 3633 maximal
702.51/702.78 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
702.51/702.78 c trivial : 0.00 0 0 0 0 0 0 0 0
702.51/702.78 c dualfix : 0.00 0 0 0 0 0 0 0 0
702.51/702.78 c boundshift : 0.00 0 0 0 0 0 0 0 0
702.51/702.78 c inttobinary : 0.00 0 0 0 0 0 0 0 0
702.51/702.78 c implics : 0.00 0 0 0 0 0 0 0 0
702.51/702.78 c probing : 0.00 0 0 0 0 0 0 0 0
702.51/702.78 c knapsack : 0.00 0 0 0 0 0 0 0 0
702.51/702.78 c setppc : 0.00 0 0 0 0 0 0 0 0
702.51/702.78 c linear : 0.03 0 0 0 0 0 143 0 0
702.51/702.78 c logicor : 0.01 0 0 0 0 0 0 0 0
702.51/702.78 c root node : - 1 - - 1 - - - -
702.51/702.78 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
702.51/702.78 c integral : 0 0 0 41336 0 316 2659 0 0 78964
702.51/702.78 c knapsack : 1 5 169382 0 0 868 227732 0 0 0
702.51/702.78 c setppc : 22 5 168871 0 0 2365 399950 0 0 0
702.51/702.78 c logicor : 2541+ 5 146973 0 0 933 500925 0 0 0
702.51/702.78 c countsols : 0 0 0 0 0 0 0 0 0 0
702.51/702.78 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
702.51/702.78 c integral : 73.74 0.00 0.00 73.74 0.00
702.51/702.78 c knapsack : 0.81 0.00 0.81 0.00 0.00
702.51/702.78 c setppc : 1.75 0.00 1.75 0.00 0.00
702.51/702.78 c logicor : 11.39 0.00 11.39 0.00 0.00
702.51/702.78 c countsols : 0.00 0.00 0.00 0.00 0.00
702.51/702.78 c Propagators : Time Calls Cutoffs DomReds
702.51/702.78 c rootredcost : 0.05 0 0 0
702.51/702.78 c pseudoobj : 2.47 169749 1 0
702.51/702.78 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
702.51/702.78 c propagation : 0.33 4166 4165 21494 17.1 43 14.3 -
702.51/702.78 c infeasible LP : 1.47 35000 0 0 0.0 0 0.0 0
702.51/702.78 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
702.51/702.78 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
702.51/702.78 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
702.51/702.78 c applied globally : - - - 10430 15.2 - - -
702.51/702.78 c applied locally : - - - 4 33.5 - - -
702.51/702.78 c Separators : Time Calls Cutoffs DomReds Cuts Conss
702.51/702.78 c cut pool : 0.01 4 - - 0 - (maximal pool size: 435)
702.51/702.78 c redcost : 0.84 39893 0 0 0 0
702.51/702.78 c impliedbounds : 0.00 5 0 0 0 0
702.51/702.78 c intobj : 0.00 0 0 0 0 0
702.51/702.78 c gomory : 0.55 5 0 0 2103 0
702.51/702.78 c strongcg : 0.39 5 0 0 2500 0
702.51/702.78 c cmir : 0.00 0 0 0 0 0
702.51/702.78 c flowcover : 0.00 0 0 0 0 0
702.51/702.78 c clique : 0.00 5 0 0 0 0
702.51/702.78 c zerohalf : 0.00 0 0 0 0 0
702.51/702.78 c mcf : 0.01 1 0 0 0 0
702.51/702.78 c Pricers : Time Calls Vars
702.51/702.78 c problem variables: 0.00 0 0
702.51/702.78 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
702.51/702.78 c relpscost : 73.61 41336 316 2659 0 0 78964
702.51/702.78 c pscost : 0.00 0 0 0 0 0 0
702.51/702.78 c inference : 0.00 0 0 0 0 0 0
702.51/702.78 c mostinf : 0.00 0 0 0 0 0 0
702.51/702.78 c leastinf : 0.00 0 0 0 0 0 0
702.51/702.78 c fullstrong : 0.00 0 0 0 0 0 0
702.51/702.78 c allfullstrong : 0.00 0 0 0 0 0 0
702.51/702.78 c random : 0.00 0 0 0 0 0 0
702.51/702.78 c Primal Heuristics : Time Calls Found
702.51/702.78 c LP solutions : 0.00 - 0
702.51/702.78 c pseudo solutions : 0.00 - 0
702.51/702.78 c simplerounding : 0.00 0 0
702.51/702.78 c rounding : 0.00 0 0
702.51/702.78 c shifting : 0.00 0 0
702.51/702.78 c intshifting : 0.00 0 0
702.51/702.78 c oneopt : 0.00 0 0
702.51/702.78 c fixandinfer : 0.00 0 0
702.51/702.78 c feaspump : 0.00 0 0
702.51/702.78 c coefdiving : 0.00 0 0
702.51/702.78 c pscostdiving : 0.00 0 0
702.51/702.78 c fracdiving : 0.00 0 0
702.51/702.78 c veclendiving : 0.00 0 0
702.51/702.78 c intdiving : 0.00 0 0
702.51/702.78 c actconsdiving : 0.00 0 0
702.51/702.78 c objpscostdiving : 0.00 0 0
702.51/702.78 c rootsoldiving : 0.00 0 0
702.51/702.78 c linesearchdiving : 0.00 0 0
702.51/702.78 c guideddiving : 0.00 0 0
702.51/702.78 c octane : 0.00 0 0
702.51/702.78 c rens : 0.00 0 0
702.51/702.78 c rins : 0.00 0 0
702.51/702.78 c localbranching : 0.00 0 0
702.51/702.78 c mutation : 0.00 0 0
702.51/702.78 c crossover : 0.00 0 0
702.51/702.78 c dins : 0.00 0 0
702.51/702.78 c LP : Time Calls Iterations Iter/call Iter/sec
702.51/702.78 c primal LP : 0.01 0 0 0.00 0.00
702.51/702.78 c dual LP : 565.59 76206 2029475 26.63 3588.24
702.51/702.78 c barrier LP : 0.00 0 0 0.00 -
702.51/702.78 c diving/probing LP: 0.00 0 0 0.00 -
702.51/702.78 c strong branching : 72.10 6194 295964 47.78 4104.91
702.51/702.78 c (at root node) : - 20 3145 157.25 -
702.51/702.78 c conflict analysis: 0.00 0 0 0.00 -
702.51/702.78 c B&B Tree :
702.51/702.78 c number of runs : 1
702.51/702.78 c nodes : 78642
702.51/702.78 c nodes (total) : 78642
702.51/702.78 c nodes left : 0
702.51/702.78 c max depth : 58
702.51/702.78 c max depth (total): 58
702.51/702.78 c backtracks : 9053 (11.5%)
702.51/702.78 c delayed cutoffs : 323
702.51/702.78 c repropagations : 9126 (30707 domain reductions, 323 cutoffs)
702.51/702.78 c avg switch length: 5.09
702.51/702.78 c switching time : 12.78
702.51/702.78 c Solution :
702.51/702.78 c Solutions found : 0 (0 improvements)
702.51/702.78 c Primal Bound : infeasible
702.51/702.78 c Dual Bound : -
702.51/702.78 c Gap : 0.00 %
702.51/702.78 c Root Dual Bound : +1.10000000000000e+01
702.51/702.79 c Time complete: 702.61.