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-1868323-1245120900.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.00/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 | 63 |3513k| 0 | 34 | 231 |2564 |2564 | 231 |2564 | 0 | 0 | 0 | 1.100000e+01 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 128 |3673k| 0 | 53 | 231 |2564 |2564 | 231 |2570 | 6 | 0 | 0 | 1.100000e+01 | -- | Inf
0.39/0.42 c 0.4s| 1 | 0 | 268 |3798k| 0 | 54 | 231 |2564 |2564 | 231 |2574 | 10 | 0 | 0 | 1.100000e+01 | -- | Inf
0.58/0.64 c 0.6s| 1 | 0 | 431 |4084k| 0 | 49 | 231 |2564 |2564 | 231 |2577 | 13 | 0 | 0 | 1.100000e+01 | -- | Inf
0.89/0.91 c 0.8s| 1 | 0 | 842 |4342k| 0 | 46 | 231 |2564 |2564 | 231 |2581 | 17 | 0 | 0 | 1.100000e+01 | -- | Inf
0.99/1.02 c 0.9s| 1 | 0 | 913 |4481k| 0 | 43 | 231 |2564 |2564 | 231 |2585 | 21 | 0 | 0 | 1.100000e+01 | -- | Inf
2.19/2.20 c 2.1s| 1 | 2 | 913 |4481k| 0 | 43 | 231 |2564 |2564 | 231 |2585 | 21 | 0 | 18 | 1.100000e+01 | -- | Inf
143.94/144.01 c 143s| 10000 | 1007 |385557 |7150k| 62 | - | 231 |2833 |1530 | 231 |2568 | 21 | 964 |2208 | 1.400000e+01 | -- | Inf
241.91/242.08 c 241s| 20000 | 1305 |730976 |8099k| 62 | - | 231 |2992 |1534 | 231 |2568 | 21 |2516 |2499 | 1.500000e+01 | -- | Inf
349.16/349.32 c 347s| 30000 | 1587 | 1075k|8956k| 62 | - | 231 |2925 |1010 | 231 |2568 | 21 |3330 |3224 | 1.500000e+01 | -- | Inf
451.73/451.93 c 449s| 40000 | 1759 | 1401k|9663k| 62 | - | 231 |2831 |1235 | 231 |2568 | 21 |3874 |3794 | 1.500000e+01 | -- | Inf
550.00/550.21 c 547s| 50000 | 1403 | 1712k|9043k| 62 | 31 | 231 |2933 |1103 | 231 |2568 | 21 |4529 |4304 | 1.600000e+01 | -- | Inf
643.27/643.52 c 640s| 60000 | 836 | 2010k|7788k| 62 | - | 231 |3067 |1091 | 231 |2568 | 21 |5414 |4651 | 1.700000e+01 | -- | Inf
702.94/703.29 c
702.94/703.29 c SCIP Status : problem is solved [infeasible]
702.94/703.29 c Solving Time (sec) : 699.45
702.94/703.29 c Solving Nodes : 67442
702.94/703.29 c Primal Bound : +1.00000000000000e+20 (0 solutions)
702.94/703.29 c Dual Bound : +1.00000000000000e+20
702.94/703.29 c Gap : 0.00 %
702.94/703.29 c NODE 67442
702.94/703.29 c DUAL BOUND 1e+20
702.94/703.29 c PRIMAL BOUND 1e+20
702.94/703.29 c GAP 0
702.94/703.29 s UNSATISFIABLE
702.94/703.29 c SCIP Status : problem is solved [infeasible]
702.94/703.29 c Solving Time : 699.45
702.94/703.29 c Original Problem :
702.94/703.29 c Problem name : HOME/instance-1868323-1245120900.opb
702.94/703.29 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
702.94/703.29 c Constraints : 2707 initial, 2707 maximal
702.94/703.29 c Presolved Problem :
702.94/703.29 c Problem name : t_HOME/instance-1868323-1245120900.opb
702.94/703.29 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
702.94/703.29 c Constraints : 2564 initial, 3251 maximal
702.94/703.29 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
702.94/703.29 c trivial : 0.00 0 0 0 0 0 0 0 0
702.94/703.29 c dualfix : 0.00 0 0 0 0 0 0 0 0
702.94/703.29 c boundshift : 0.00 0 0 0 0 0 0 0 0
702.94/703.29 c inttobinary : 0.00 0 0 0 0 0 0 0 0
702.94/703.29 c implics : 0.00 0 0 0 0 0 0 0 0
702.94/703.29 c probing : 0.00 0 0 0 0 0 0 0 0
702.94/703.29 c knapsack : 0.00 0 0 0 0 0 0 0 0
702.94/703.29 c setppc : 0.00 0 0 0 0 0 0 0 0
702.94/703.29 c linear : 0.02 0 0 0 0 0 143 0 0
702.94/703.29 c logicor : 0.03 0 0 0 0 0 0 0 0
702.94/703.29 c root node : - 1 - - 1 - - - -
702.94/703.29 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
702.94/703.29 c integral : 0 0 0 34983 0 223 1877 0 0 67566
702.94/703.29 c knapsack : 1 5 140202 0 0 449 168505 0 0 0
702.94/703.29 c setppc : 22 5 139925 0 0 1576 349912 0 0 0
702.94/703.29 c logicor : 2541+ 5 122348 0 0 427 393823 0 0 0
702.94/703.29 c countsols : 0 0 0 0 0 0 0 0 0 0
702.94/703.29 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
702.94/703.29 c integral : 82.64 0.00 0.00 82.64 0.00
702.94/703.29 c knapsack : 0.67 0.00 0.67 0.00 0.00
702.94/703.29 c setppc : 1.72 0.00 1.72 0.00 0.00
702.94/703.29 c logicor : 8.76 0.00 8.76 0.00 0.00
702.94/703.29 c countsols : 0.00 0.00 0.00 0.00 0.00
702.94/703.29 c Propagators : Time Calls Cutoffs DomReds
702.94/703.29 c rootredcost : 0.07 0 0 0
702.94/703.29 c pseudoobj : 1.89 140385 1 0
702.94/703.29 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
702.94/703.29 c propagation : 0.23 2452 2452 11595 15.7 21 14.2 -
702.94/703.29 c infeasible LP : 1.05 31108 0 0 0.0 0 0.0 0
702.94/703.29 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
702.94/703.29 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
702.94/703.29 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
702.94/703.29 c applied globally : - - - 5916 14.5 - - -
702.94/703.29 c applied locally : - - - 6 32.5 - - -
702.94/703.29 c Separators : Time Calls Cutoffs DomReds Cuts Conss
702.94/703.29 c cut pool : 0.00 4 - - 1 - (maximal pool size: 453)
702.94/703.29 c redcost : 0.61 34061 0 0 0 0
702.94/703.29 c impliedbounds : 0.00 5 0 0 0 0
702.94/703.29 c intobj : 0.00 0 0 0 0 0
702.94/703.29 c gomory : 0.30 5 0 0 2500 0
702.94/703.29 c strongcg : 0.27 5 0 0 2500 0
702.94/703.29 c cmir : 0.00 0 0 0 0 0
702.94/703.29 c flowcover : 0.00 0 0 0 0 0
702.94/703.29 c clique : 0.00 5 0 0 0 0
702.94/703.29 c zerohalf : 0.00 0 0 0 0 0
702.94/703.29 c mcf : 0.00 1 0 0 0 0
702.94/703.29 c Pricers : Time Calls Vars
702.94/703.29 c problem variables: 0.00 0 0
702.94/703.29 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
702.94/703.29 c relpscost : 82.51 34983 223 1877 0 0 67566
702.94/703.29 c pscost : 0.00 0 0 0 0 0 0
702.94/703.29 c inference : 0.00 0 0 0 0 0 0
702.94/703.29 c mostinf : 0.00 0 0 0 0 0 0
702.94/703.29 c leastinf : 0.00 0 0 0 0 0 0
702.94/703.29 c fullstrong : 0.00 0 0 0 0 0 0
702.94/703.29 c allfullstrong : 0.00 0 0 0 0 0 0
702.94/703.29 c random : 0.00 0 0 0 0 0 0
702.94/703.29 c Primal Heuristics : Time Calls Found
702.94/703.29 c LP solutions : 0.00 - 0
702.94/703.29 c pseudo solutions : 0.00 - 0
702.94/703.29 c simplerounding : 0.00 0 0
702.94/703.29 c rounding : 0.00 0 0
702.94/703.29 c shifting : 0.00 0 0
702.94/703.29 c intshifting : 0.00 0 0
702.94/703.29 c oneopt : 0.00 0 0
702.94/703.29 c fixandinfer : 0.00 0 0
702.94/703.29 c feaspump : 0.00 0 0
702.94/703.29 c coefdiving : 0.00 0 0
702.94/703.29 c pscostdiving : 0.00 0 0
702.94/703.29 c fracdiving : 0.00 0 0
702.94/703.29 c veclendiving : 0.00 0 0
702.94/703.29 c intdiving : 0.00 0 0
702.94/703.29 c actconsdiving : 0.00 0 0
702.94/703.29 c objpscostdiving : 0.00 0 0
702.94/703.29 c rootsoldiving : 0.00 0 0
702.94/703.29 c linesearchdiving : 0.00 0 0
702.94/703.29 c guideddiving : 0.00 0 0
702.94/703.29 c octane : 0.00 0 0
702.94/703.29 c rens : 0.00 0 0
702.94/703.29 c rins : 0.00 0 0
702.94/703.29 c localbranching : 0.00 0 0
702.94/703.29 c mutation : 0.00 0 0
702.94/703.29 c crossover : 0.00 0 0
702.94/703.29 c dins : 0.00 0 0
702.94/703.29 c LP : Time Calls Iterations Iter/call Iter/sec
702.94/703.29 c primal LP : 0.00 0 0 0.00 -
702.94/703.29 c dual LP : 569.38 65903 2171662 32.95 3814.08
702.94/703.29 c barrier LP : 0.00 0 0 0.00 -
702.94/703.29 c diving/probing LP: 0.00 0 0 0.00 -
702.94/703.29 c strong branching : 81.11 4947 334860 67.69 4128.47
702.94/703.29 c (at root node) : - 18 3608 200.44 -
702.94/703.29 c conflict analysis: 0.00 0 0 0.00 -
702.94/703.29 c B&B Tree :
702.94/703.29 c number of runs : 1
702.94/703.29 c nodes : 67442
702.94/703.29 c nodes (total) : 67442
702.94/703.29 c nodes left : 0
702.94/703.29 c max depth : 62
702.94/703.29 c max depth (total): 62
702.94/703.29 c backtracks : 7276 (10.8%)
702.94/703.29 c delayed cutoffs : 125
702.94/703.29 c repropagations : 5573 (14106 domain reductions, 125 cutoffs)
702.94/703.29 c avg switch length: 4.85
702.94/703.29 c switching time : 10.44
702.94/703.29 c Solution :
702.94/703.29 c Solutions found : 0 (0 improvements)
702.94/703.29 c Primal Bound : infeasible
702.94/703.29 c Dual Bound : -
702.94/703.29 c Gap : 0.00 %
702.94/703.29 c Root Dual Bound : +1.10000000000000e+01
703.04/703.31 c Time complete: 703.06.