0.09/0.17 c SCIP version 1.1.0.7
0.09/0.17 c LP-Solver SoPlex 1.4.1
0.09/0.17 c user parameter file <scip.set> not found - using default parameters
0.09/0.17 c read problem <HOME/instance-1868604-1245129078.opb>
0.09/0.17 c original problem has 3939 variables (3939 bin, 0 int, 0 impl, 0 cont) and 10412 constraints
0.19/0.23 c No objective function, only one solution is needed.
0.19/0.23 c start presolving problem
0.19/0.23 c presolving:
0.39/0.41 c (round 1) 519 del vars, 651 del conss, 221 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170882 impls, 0 clqs
0.39/0.43 c (round 2) 520 del vars, 1331 del conss, 222 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170882 impls, 0 clqs
0.39/0.44 c (round 3) 542 del vars, 1384 del conss, 244 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170954 impls, 0 clqs
0.39/0.45 c (round 4) 546 del vars, 1390 del conss, 248 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170954 impls, 0 clqs
0.39/0.46 c (round 5) 552 del vars, 1401 del conss, 254 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 170968 impls, 0 clqs
0.39/0.47 c (round 6) 556 del vars, 1415 del conss, 258 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 171196 impls, 0 clqs
0.39/0.48 c (round 7) 560 del vars, 1425 del conss, 262 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 171224 impls, 0 clqs
0.39/0.49 c (round 8) 560 del vars, 1433 del conss, 262 chg bounds, 336 chg sides, 724 chg coeffs, 0 upgd conss, 171264 impls, 0 clqs
0.49/0.60 c (round 9) 560 del vars, 1439 del conss, 262 chg bounds, 336 chg sides, 724 chg coeffs, 8973 upgd conss, 171264 impls, 0 clqs
0.58/0.66 c presolving (10 rounds):
0.58/0.66 c 560 deleted vars, 1439 deleted constraints, 262 tightened bounds, 0 added holes, 336 changed sides, 724 changed coefficients
0.58/0.66 c 171264 implications, 0 cliques
0.58/0.66 c presolved problem has 3379 variables (3379 bin, 0 int, 0 impl, 0 cont) and 8973 constraints
0.58/0.66 c 672 constraints of type <knapsack>
0.58/0.66 c 8301 constraints of type <logicor>
0.58/0.66 c transformed objective value is always integral (scale: 1)
0.58/0.66 c Presolving Time: 0.38
0.58/0.66 c SATUNSAT-LIN
0.58/0.66 c -----------------------------------------------------------------------------------------------
0.58/0.66 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.58/0.66 c # [type: int, range: [-1,2147483647], default: 0]
0.58/0.66 c separating/flowcover/freq = c -1
0.58/0.66 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.58/0.66 c # [type: int, range: [-1,2147483647], default: 0]
0.58/0.66 c separating/cmir/freq = c -1
0.58/0.66 c # additional number of allowed LP iterations
0.58/0.66 c # [type: int, range: [0,2147483647], default: 1000]
0.58/0.66 c heuristics/veclendiving/maxlpiterofs = c 1500
0.58/0.66 c # maximal fraction of diving LP iterations compared to node LP iterations
0.58/0.66 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.58/0.66 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.58/0.66 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.58/0.66 c # [type: int, range: [-1,2147483647], default: 10]
0.58/0.66 c heuristics/veclendiving/freq = c -1
0.58/0.66 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.58/0.66 c # [type: int, range: [-1,2147483647], default: 1]
0.58/0.66 c heuristics/simplerounding/freq = c -1
0.58/0.66 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.58/0.66 c # [type: int, range: [-1,2147483647], default: 10]
0.58/0.66 c heuristics/shifting/freq = c -1
0.58/0.66 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.58/0.66 c # [type: int, range: [-1,2147483647], default: 1]
0.58/0.66 c heuristics/rounding/freq = c -1
0.58/0.66 c # additional number of allowed LP iterations
0.58/0.66 c # [type: int, range: [0,2147483647], default: 1000]
0.58/0.66 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.58/0.66 c # maximal fraction of diving LP iterations compared to node LP iterations
0.58/0.66 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.58/0.66 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.58/0.66 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.58/0.66 c # [type: int, range: [-1,2147483647], default: 20]
0.58/0.66 c heuristics/rootsoldiving/freq = c -1
0.58/0.66 c # number of nodes added to the contingent of the total nodes
0.58/0.66 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.58/0.66 c heuristics/rens/nodesofs = c 2000
0.58/0.66 c # minimum percentage of integer variables that have to be fixable
0.58/0.66 c # [type: real, range: [0,1], default: 0.5]
0.58/0.66 c heuristics/rens/minfixingrate = c 0.3
0.58/0.66 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.58/0.66 c # [type: int, range: [-1,2147483647], default: 0]
0.58/0.66 c heuristics/rens/freq = c -1
0.58/0.66 c # additional number of allowed LP iterations
0.58/0.66 c # [type: int, range: [0,2147483647], default: 1000]
0.58/0.66 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.58/0.66 c # maximal fraction of diving LP iterations compared to node LP iterations
0.58/0.66 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.58/0.66 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.58/0.66 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.58/0.66 c # [type: int, range: [-1,2147483647], default: 10]
0.58/0.66 c heuristics/pscostdiving/freq = c -1
0.58/0.66 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.58/0.66 c # [type: int, range: [-1,2147483647], default: 1]
0.58/0.66 c heuristics/oneopt/freq = c -1
0.58/0.66 c # additional number of allowed LP iterations
0.58/0.66 c # [type: int, range: [0,2147483647], default: 1000]
0.58/0.66 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.58/0.66 c # maximal fraction of diving LP iterations compared to total iteration number
0.58/0.66 c # [type: real, range: [0,1], default: 0.01]
0.58/0.66 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.58/0.66 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.58/0.66 c # [type: int, range: [-1,2147483647], default: 20]
0.58/0.66 c heuristics/objpscostdiving/freq = c -1
0.58/0.66 c # additional number of allowed LP iterations
0.58/0.66 c # [type: int, range: [0,2147483647], default: 1000]
0.58/0.66 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.58/0.66 c # maximal fraction of diving LP iterations compared to node LP iterations
0.58/0.66 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.58/0.66 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.58/0.66 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.58/0.66 c # [type: int, range: [-1,2147483647], default: 10]
0.58/0.66 c heuristics/linesearchdiving/freq = c -1
0.58/0.66 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.58/0.66 c # [type: int, range: [-1,2147483647], default: 10]
0.58/0.66 c heuristics/intshifting/freq = c -1
0.58/0.66 c # maximal fraction of diving LP iterations compared to node LP iterations
0.58/0.66 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.58/0.66 c heuristics/intdiving/maxlpiterquot = c 0.075
0.58/0.66 c # additional number of allowed LP iterations
0.58/0.66 c # [type: int, range: [0,2147483647], default: 1000]
0.58/0.66 c heuristics/guideddiving/maxlpiterofs = c 1500
0.58/0.66 c # maximal fraction of diving LP iterations compared to node LP iterations
0.58/0.66 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.58/0.66 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.58/0.66 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.58/0.66 c # [type: int, range: [-1,2147483647], default: 10]
0.58/0.66 c heuristics/guideddiving/freq = c -1
0.58/0.66 c # additional number of allowed LP iterations
0.58/0.66 c # [type: int, range: [0,2147483647], default: 1000]
0.58/0.66 c heuristics/fracdiving/maxlpiterofs = c 1500
0.58/0.66 c # maximal fraction of diving LP iterations compared to node LP iterations
0.58/0.66 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.58/0.66 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.58/0.66 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.58/0.66 c # [type: int, range: [-1,2147483647], default: 10]
0.58/0.66 c heuristics/fracdiving/freq = c -1
0.58/0.66 c # additional number of allowed LP iterations
0.58/0.66 c # [type: int, range: [0,2147483647], default: 1000]
0.58/0.66 c heuristics/feaspump/maxlpiterofs = c 2000
0.58/0.66 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.58/0.66 c # [type: int, range: [-1,2147483647], default: 20]
0.58/0.66 c heuristics/feaspump/freq = c -1
0.58/0.66 c # minimum percentage of integer variables that have to be fixed
0.58/0.66 c # [type: real, range: [0,1], default: 0.666]
0.58/0.66 c heuristics/crossover/minfixingrate = c 0.5
0.58/0.66 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.58/0.66 c # [type: real, range: [0,1], default: 0.1]
0.58/0.66 c heuristics/crossover/nodesquot = c 0.15
0.58/0.66 c # number of nodes without incumbent change that heuristic should wait
0.58/0.66 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.58/0.66 c heuristics/crossover/nwaitingnodes = c 100
0.58/0.66 c # number of nodes added to the contingent of the total nodes
0.58/0.66 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.58/0.66 c heuristics/crossover/nodesofs = c 750
0.58/0.66 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.58/0.66 c # [type: int, range: [-1,2147483647], default: 30]
0.58/0.66 c heuristics/crossover/freq = c -1
0.58/0.66 c # additional number of allowed LP iterations
0.58/0.66 c # [type: int, range: [0,2147483647], default: 1000]
0.58/0.66 c heuristics/coefdiving/maxlpiterofs = c 1500
0.58/0.66 c # maximal fraction of diving LP iterations compared to node LP iterations
0.58/0.66 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.58/0.66 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.58/0.66 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.58/0.66 c # [type: int, range: [-1,2147483647], default: 10]
0.58/0.66 c heuristics/coefdiving/freq = c -1
0.58/0.66 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.58/0.66 c # [type: int, range: [-1,2147483647], default: -1]
0.58/0.66 c presolving/probing/maxrounds = c 0
0.58/0.66 c # should presolving try to simplify knapsacks
0.58/0.66 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.58/0.66 c constraints/knapsack/simplifyinequalities = c TRUE
0.58/0.66 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.58/0.66 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.58/0.66 c constraints/knapsack/disaggregation = c FALSE
0.58/0.66 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.58/0.66 c # [type: int, range: [-1,2147483647], default: -1]
0.58/0.66 c constraints/knapsack/maxnumcardlift = c 0
0.58/0.66 c # should presolving try to simplify inequalities
0.58/0.66 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.58/0.66 c constraints/linear/simplifyinequalities = c TRUE
0.58/0.66 c # maximal number of separation rounds in the root node (-1: unlimited)
0.58/0.66 c # [type: int, range: [-1,2147483647], default: -1]
0.58/0.66 c separating/maxroundsroot = c 5
0.58/0.66 c # maximal number of separation rounds per node (-1: unlimited)
0.58/0.66 c # [type: int, range: [-1,2147483647], default: 5]
0.58/0.66 c separating/maxrounds = c 1
0.58/0.66 c # solving stops, if the given number of solutions were found (-1: no limit)
0.58/0.66 c # [type: int, range: [-1,2147483647], default: -1]
0.58/0.66 c limits/solutions = c 1
0.58/0.66 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.58/0.66 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.58/0.66 c limits/memory = c 1620
0.58/0.66 c # maximal time in seconds to run
0.58/0.66 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.58/0.66 c limits/time = c 1791
0.58/0.66 c # frequency for displaying node information lines
0.58/0.66 c # [type: int, range: [-1,2147483647], default: 100]
0.58/0.66 c display/freq = c 10000
0.58/0.66 c -----------------------------------------------------------------------------------------------
0.58/0.66 c start solving problem
0.58/0.66 c
1.10/1.11 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.10/1.11 c 0.8s| 1 | 0 | 1064 | 24M| 0 | 525 |3379 |8973 |8973 |3379 |8973 | 0 | 0 | 0 | 2.893511e+02 | -- | Inf
1.99/2.01 c 1.7s| 1 | 0 | 1533 | 24M| 0 | 580 |3379 |8973 |8973 |3379 |9090 | 117 | 0 | 0 | 3.577308e+02 | -- | Inf
2.59/2.68 c 2.4s| 1 | 0 | 1856 | 25M| 0 | 689 |3379 |8973 |8973 |3379 |9173 | 200 | 0 | 0 | 3.746480e+02 | -- | Inf
4.49/4.52 c 4.2s| 1 | 0 | 2561 | 25M| 0 | 633 |3379 |8973 |8973 |3379 |9334 | 361 | 0 | 0 | 3.952770e+02 | -- | Inf
5.49/5.55 c 5.2s| 1 | 0 | 3189 | 25M| 0 | 590 |3379 |8973 |8973 |3379 |9453 | 480 | 0 | 0 | 3.985432e+02 | -- | Inf
6.38/6.50 c 6.2s| 1 | 0 | 3654 | 26M| 0 | 606 |3379 |8973 |8973 |3379 |9557 | 584 | 0 | 0 | 4.159775e+02 | -- | Inf
21.38/21.42 c 21.0s| 1 | 0 | 3928 | 26M| 0 | 613 |3379 |8949 |8949 |3379 |9557 | 584 | 0 | 18 | 4.165770e+02 | -- | Inf
37.47/37.55 c 37.1s| 1 | 0 | 4758 | 25M| 0 | 632 |3379 |8308 |8308 |3379 |9557 | 584 | 0 | 40 | 4.429722e+02 | -- | Inf
50.27/50.30 c 49.8s| 1 | 2 | 4758 | 25M| 0 | 632 |3379 |8308 |8308 |3379 |9557 | 584 | 0 | 60 | 4.429722e+02 | -- | Inf
50.27/50.30 c (run 1, node 1) restarting after 339 global fixings of integer variables
50.27/50.31 c
50.27/50.31 (restart) converted 457 cuts from the global cut pool into linear constraints
50.27/50.33 c
50.27/50.33 presolving:
50.36/50.42 c (round 1) 783 del vars, 1058 del conss, 38 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 189330 impls, 8 clqs
50.36/50.44 c (round 2) 866 del vars, 1165 del conss, 38 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 191148 impls, 5 clqs
50.36/50.46 c (round 3) 880 del vars, 1214 del conss, 40 chg bounds, 0 chg sides, 0 chg coeffs, 451 upgd conss, 191648 impls, 5 clqs
50.36/50.47 c (round 4) 888 del vars, 1226 del conss, 40 chg bounds, 0 chg sides, 0 chg coeffs, 451 upgd conss, 191962 impls, 5 clqs
50.36/50.48 c (round 5) 893 del vars, 1243 del conss, 40 chg bounds, 0 chg sides, 0 chg coeffs, 451 upgd conss, 191978 impls, 5 clqs
50.36/50.49 c (round 6) 896 del vars, 1246 del conss, 40 chg bounds, 0 chg sides, 0 chg coeffs, 451 upgd conss, 192112 impls, 5 clqs
50.47/50.52 c presolving (7 rounds):
50.47/50.52 c 896 deleted vars, 1246 deleted constraints, 40 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
50.47/50.52 c 192112 implications, 5 cliques
50.47/50.52 c presolved problem has 2483 variables (2483 bin, 0 int, 0 impl, 0 cont) and 7519 constraints
50.47/50.52 c 761 constraints of type <knapsack>
50.47/50.52 c 5 constraints of type <setppc>
50.47/50.52 c 6753 constraints of type <logicor>
50.47/50.52 c transformed objective value is always integral (scale: 1)
50.47/50.52 c Presolving Time: 0.55
50.47/50.52 c
51.16/51.23 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
51.16/51.23 c 50.7s| 1 | 0 | 6270 | 21M| 0 | 586 |2483 |7519 |7519 |2483 |6746 | 0 | 0 | 60 | 4.469722e+02 | -- | Inf
52.16/52.25 c 51.7s| 1 | 0 | 6669 | 22M| 0 | 540 |2483 |7519 |7519 |2483 |6858 | 112 | 0 | 60 | 4.518937e+02 | -- | Inf
57.56/57.60 c 57.1s| 1 | 2 | 6669 | 22M| 0 | 540 |2483 |7519 |7519 |2483 |6858 | 112 | 0 | 77 | 4.518937e+02 | -- | Inf
232.80/232.97 c
232.80/232.97 c SCIP Status : problem is solved [infeasible]
232.80/232.97 c Solving Time (sec) : 231.70
232.80/232.97 c Solving Nodes : 974 (total of 975 nodes in 2 runs)
232.80/232.97 c Primal Bound : +1.00000000000000e+20 (0 solutions)
232.80/232.97 c Dual Bound : +1.00000000000000e+20
232.80/232.97 c Gap : 0.00 %
232.80/232.97 c NODE 974
232.80/232.97 c DUAL BOUND 1e+20
232.80/232.97 c PRIMAL BOUND 1e+20
232.80/232.97 c GAP 0
232.80/232.97 s UNSATISFIABLE
232.80/232.97 c SCIP Status : problem is solved [infeasible]
232.80/232.97 c Solving Time : 231.70
232.80/232.97 c Original Problem :
232.80/232.97 c Problem name : HOME/instance-1868604-1245129078.opb
232.80/232.97 c Variables : 3939 (3939 binary, 0 integer, 0 implicit integer, 0 continuous)
232.80/232.97 c Constraints : 10412 initial, 10412 maximal
232.80/232.97 c Presolved Problem :
232.80/232.97 c Problem name : t_HOME/instance-1868604-1245129078.opb
232.80/232.97 c Variables : 2483 (2483 binary, 0 integer, 0 implicit integer, 0 continuous)
232.80/232.97 c Constraints : 7519 initial, 8350 maximal
232.80/232.97 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
232.80/232.97 c trivial : 0.01 389 0 0 0 0 0 0 0
232.80/232.97 c dualfix : 0.00 3 0 0 0 0 0 0 0
232.80/232.97 c boundshift : 0.00 0 0 0 0 0 0 0 0
232.80/232.97 c inttobinary : 0.00 0 0 0 0 0 0 0 0
232.80/232.97 c implics : 0.05 0 684 0 0 0 0 0 0
232.80/232.97 c probing : 0.00 0 0 0 0 0 0 0 0
232.80/232.97 c knapsack : 0.09 0 0 0 0 0 1 0 0
232.80/232.97 c setppc : 0.00 0 0 0 0 0 0 0 0
232.80/232.97 c linear : 0.24 262 4 0 262 0 1445 336 724
232.80/232.97 c logicor : 0.12 114 0 0 40 0 1239 0 0
232.80/232.97 c root node : - 535 - - 535 - - - -
232.80/232.97 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
232.80/232.97 c integral : 0 0 0 741 0 15 153 0 0 1366
232.80/232.97 c knapsack : 761 6 15026 0 0 0 2 1196 0 0
232.80/232.97 c setppc : 5 1 14948 0 0 0 49 0 0 0
232.80/232.97 c logicor : 6753+ 6 14271 0 0 448 73345 0 0 0
232.80/232.97 c countsols : 0 0 0 0 0 0 0 0 0 0
232.80/232.97 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
232.80/232.97 c integral : 163.54 0.00 0.00 163.54 0.00
232.80/232.97 c knapsack : 0.34 0.03 0.31 0.00 0.00
232.80/232.97 c setppc : 0.00 0.00 0.00 0.00 0.00
232.80/232.97 c logicor : 0.73 0.01 0.72 0.00 0.00
232.80/232.97 c countsols : 0.00 0.00 0.00 0.00 0.00
232.80/232.97 c Propagators : Time Calls Cutoffs DomReds
232.80/232.97 c rootredcost : 0.01 0 0 0
232.80/232.97 c pseudoobj : 1.93 15063 0 0
232.80/232.97 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
232.80/232.97 c propagation : 0.07 448 448 2135 24.6 129 11.0 -
232.80/232.97 c infeasible LP : 0.01 18 18 39 10.4 5 5.0 0
232.80/232.97 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
232.80/232.97 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
232.80/232.97 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
232.80/232.97 c applied globally : - - - 1161 15.5 - - -
232.80/232.97 c applied locally : - - - 0 0.0 - - -
232.80/232.97 c Separators : Time Calls Cutoffs DomReds Cuts Conss
232.80/232.97 c cut pool : 0.00 0 - - 0 - (maximal pool size: 376)
232.80/232.97 c redcost : 0.13 705 0 0 0 0
232.80/232.97 c impliedbounds : 0.00 6 0 0 0 0
232.80/232.97 c intobj : 0.00 0 0 0 0 0
232.80/232.97 c gomory : 1.86 6 0 0 2734 0
232.80/232.97 c strongcg : 1.14 6 0 0 3000 0
232.80/232.97 c cmir : 0.00 0 0 0 0 0
232.80/232.97 c flowcover : 0.00 0 0 0 0 0
232.80/232.97 c clique : 0.24 6 0 0 42 0
232.80/232.97 c zerohalf : 0.00 0 0 0 0 0
232.80/232.97 c mcf : 0.05 2 0 0 0 0
232.80/232.97 c Pricers : Time Calls Vars
232.80/232.97 c problem variables: 0.00 0 0
232.80/232.97 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
232.80/232.97 c relpscost : 163.54 741 15 153 0 0 1366
232.80/232.97 c pscost : 0.00 0 0 0 0 0 0
232.80/232.97 c inference : 0.00 0 0 0 0 0 0
232.80/232.97 c mostinf : 0.00 0 0 0 0 0 0
232.80/232.97 c leastinf : 0.00 0 0 0 0 0 0
232.80/232.97 c fullstrong : 0.00 0 0 0 0 0 0
232.80/232.97 c allfullstrong : 0.00 0 0 0 0 0 0
232.80/232.97 c random : 0.00 0 0 0 0 0 0
232.80/232.98 c Primal Heuristics : Time Calls Found
232.80/232.98 c LP solutions : 0.00 - 0
232.80/232.98 c pseudo solutions : 0.00 - 0
232.80/232.98 c simplerounding : 0.00 0 0
232.80/232.98 c rounding : 0.00 0 0
232.80/232.98 c shifting : 0.00 0 0
232.80/232.98 c intshifting : 0.00 0 0
232.80/232.98 c oneopt : 0.00 0 0
232.80/232.98 c fixandinfer : 0.00 0 0
232.80/232.98 c feaspump : 0.00 0 0
232.80/232.98 c coefdiving : 0.00 0 0
232.80/232.98 c pscostdiving : 0.00 0 0
232.80/232.98 c fracdiving : 0.00 0 0
232.80/232.98 c veclendiving : 0.00 0 0
232.80/232.98 c intdiving : 0.00 0 0
232.80/232.98 c actconsdiving : 0.00 0 0
232.80/232.98 c objpscostdiving : 0.00 0 0
232.80/232.98 c rootsoldiving : 0.00 0 0
232.80/232.98 c linesearchdiving : 0.00 0 0
232.80/232.98 c guideddiving : 0.00 0 0
232.80/232.98 c octane : 0.00 0 0
232.80/232.98 c rens : 0.00 0 0
232.80/232.98 c rins : 0.00 0 0
232.80/232.98 c localbranching : 0.00 0 0
232.80/232.98 c mutation : 0.00 0 0
232.80/232.98 c crossover : 0.00 0 0
232.80/232.98 c dins : 0.00 0 0
232.80/232.98 c LP : Time Calls Iterations Iter/call Iter/sec
232.80/232.98 c primal LP : 0.02 0 0 0.00 0.00
232.80/232.98 c dual LP : 57.43 765 71566 93.55 1246.14
232.80/232.98 c barrier LP : 0.00 0 0 0.00 -
232.80/232.98 c diving/probing LP: 0.00 0 0 0.00 -
232.80/232.98 c strong branching : 163.26 1096 178960 163.28 1096.17
232.80/232.98 c (at root node) : - 77 41324 536.68 -
232.80/232.98 c conflict analysis: 0.00 0 0 0.00 -
232.80/232.98 c B&B Tree :
232.80/232.98 c number of runs : 2
232.80/232.98 c nodes : 974
232.80/232.98 c nodes (total) : 975
232.80/232.98 c nodes left : 0
232.80/232.98 c max depth : 40
232.80/232.98 c max depth (total): 40
232.80/232.98 c backtracks : 207 (21.3%)
232.80/232.98 c delayed cutoffs : 391
232.80/232.98 c repropagations : 1222 (24181 domain reductions, 189 cutoffs)
232.80/232.98 c avg switch length: 4.04
232.80/232.98 c switching time : 0.58
232.80/232.98 c Solution :
232.80/232.98 c Solutions found : 0 (0 improvements)
232.80/232.98 c Primal Bound : infeasible
232.80/232.98 c Dual Bound : -
232.80/232.98 c Gap : 0.00 %
232.80/232.98 c Root Dual Bound : +4.51893746416681e+02
232.90/233.05 c Time complete: 232.95.