0.00/0.01 c SCIP version 1.1.0.7
0.00/0.01 c LP-Solver SoPlex 1.4.1
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c read problem <HOME/instance-1868192-1245115926.opb>
0.00/0.01 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c start presolving problem
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.02 c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.02 c presolving (3 rounds):
0.00/0.02 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 8 implications, 68 cliques
0.00/0.02 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.02 c 1 constraints of type <knapsack>
0.00/0.02 c 68 constraints of type <setppc>
0.00/0.02 c 4 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.02
0.00/0.02 c SATUNSAT-LIN
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/flowcover/freq = c -1
0.00/0.02 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/cmir/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/veclendiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/veclendiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/simplerounding/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/shifting/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/rounding/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.00/0.02 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/rootsoldiving/freq = c -1
0.00/0.02 c # number of nodes added to the contingent of the total nodes
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02 c heuristics/rens/nodesofs = c 2000
0.00/0.02 c # minimum percentage of integer variables that have to be fixable
0.00/0.02 c # [type: real, range: [0,1], default: 0.5]
0.00/0.02 c heuristics/rens/minfixingrate = c 0.3
0.00/0.02 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/rens/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/pscostdiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/oneopt/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.02 c # [type: real, range: [0,1], default: 0.01]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.00/0.02 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/objpscostdiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/linesearchdiving/freq = c -1
0.00/0.02 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/intshifting/freq = c -1
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/intdiving/maxlpiterquot = c 0.075
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/guideddiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/guideddiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/fracdiving/maxlpiterofs = c 1500
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.00/0.02 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/fracdiving/freq = c -1
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/feaspump/maxlpiterofs = c 2000
0.00/0.02 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/feaspump/freq = c -1
0.00/0.02 c # minimum percentage of integer variables that have to be fixed
0.00/0.02 c # [type: real, range: [0,1], default: 0.666]
0.00/0.03 c heuristics/crossover/minfixingrate = c 0.5
0.00/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03 c # [type: real, range: [0,1], default: 0.1]
0.00/0.03 c heuristics/crossover/nodesquot = c 0.15
0.00/0.03 c # number of nodes without incumbent change that heuristic should wait
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03 c heuristics/crossover/nwaitingnodes = c 100
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/crossover/nodesofs = c 750
0.00/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03 c heuristics/crossover/freq = c -1
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/coefdiving/maxlpiterofs = c 1500
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/coefdiving/freq = c -1
0.00/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c presolving/probing/maxrounds = c 0
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = c TRUE
0.00/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03 c constraints/knapsack/disaggregation = c FALSE
0.00/0.03 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c constraints/knapsack/maxnumcardlift = c 0
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = c TRUE
0.00/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/maxroundsroot = c 5
0.00/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03 c separating/maxrounds = c 1
0.00/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c limits/solutions = c 1
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = c 1620
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = c 1791
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = c 10000
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving problem
0.00/0.03 c
0.00/0.03 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.03 c 0.0s| 1 | 0 | 97 | 593k| 0 | 43 | 169 | 73 | 73 | 169 | 73 | 0 | 0 | 0 | 1.300000e+01 | -- | Inf
0.04/0.05 c 0.0s| 1 | 0 | 120 | 803k| 0 | 57 | 169 | 73 | 73 | 169 | 87 | 14 | 0 | 0 | 1.300000e+01 | -- | Inf
0.04/0.07 c 0.1s| 1 | 0 | 153 | 919k| 0 | 60 | 169 | 73 | 73 | 169 | 93 | 20 | 0 | 0 | 1.300000e+01 | -- | Inf
0.04/0.09 c 0.1s| 1 | 0 | 221 | 998k| 0 | 60 | 169 | 73 | 73 | 169 | 100 | 27 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.11 c 0.1s| 1 | 0 | 252 |1061k| 0 | 62 | 169 | 73 | 73 | 169 | 105 | 32 | 0 | 0 | 1.300000e+01 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 268 |1076k| 0 | 65 | 169 | 73 | 73 | 169 | 109 | 36 | 0 | 0 | 1.300000e+01 | -- | Inf
0.69/0.77 c 0.7s| 1 | 0 | 275 |1076k| 0 | 64 | 169 | 73 | 73 | 169 | 109 | 36 | 0 | 34 | 1.300000e+01 | -- | Inf
1.00/1.05 c 1.0s| 1 | 0 | 289 |1076k| 0 | 66 | 169 | 73 | 73 | 169 | 109 | 36 | 0 | 47 | 1.300000e+01 | -- | Inf
1.29/1.33 c 1.3s| 1 | 0 | 314 |1076k| 0 | 63 | 169 | 73 | 73 | 169 | 109 | 36 | 0 | 60 | 1.300000e+01 | -- | Inf
1.59/1.60 c 1.6s| 1 | 0 | 330 |1076k| 0 | 62 | 169 | 73 | 73 | 169 | 109 | 36 | 0 | 73 | 1.300000e+01 | -- | Inf
1.69/1.71 c 1.7s| 1 | 0 | 347 |1076k| 0 | 61 | 169 | 73 | 73 | 169 | 109 | 36 | 0 | 80 | 1.300000e+01 | -- | Inf
1.79/1.87 c 1.8s| 1 | 0 | 367 |1076k| 0 | 62 | 169 | 73 | 73 | 169 | 109 | 36 | 0 | 89 | 1.300000e+01 | -- | Inf
1.89/1.99 c 1.9s| 1 | 0 | 381 |1076k| 0 | 57 | 169 | 73 | 73 | 169 | 109 | 36 | 0 | 96 | 1.300000e+01 | -- | Inf
1.99/2.06 c 2.0s| 1 | 0 | 381 |1076k| 0 | - | 169 | 73 | 73 | 169 | 109 | 36 | 0 | 100 | 1.300000e+01 | -- | Inf
1.99/2.06 c (run 1, node 1) restarting after 34 global fixings of integer variables
1.99/2.06 c
1.99/2.06 (restart) converted 36 cuts from the global cut pool into linear constraints
1.99/2.06 c
1.99/2.06 presolving:
1.99/2.07 c (round 1) 34 del vars, 4 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 0 upgd conss, 24 impls, 84 clqs
1.99/2.07 c (round 2) 34 del vars, 4 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 33 upgd conss, 24 impls, 84 clqs
1.99/2.08 c (round 3) 34 del vars, 5 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 33 upgd conss, 24 impls, 84 clqs
1.99/2.08 c presolving (4 rounds):
1.99/2.08 c 34 deleted vars, 5 deleted constraints, 0 tightened bounds, 0 added holes, 3 changed sides, 0 changed coefficients
1.99/2.08 c 24 implications, 84 cliques
1.99/2.08 c presolved problem has 135 variables (135 bin, 0 int, 0 impl, 0 cont) and 104 constraints
1.99/2.08 c 13 constraints of type <knapsack>
1.99/2.08 c 87 constraints of type <setppc>
1.99/2.08 c 4 constraints of type <logicor>
1.99/2.08 c transformed objective value is always integral (scale: 1)
1.99/2.08 c Presolving Time: 0.03
1.99/2.08 c
1.99/2.08 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.99/2.08 c 2.0s| 1 | 0 | 465 | 792k| 0 | 49 | 135 | 104 | 104 | 135 | 104 | 0 | 0 | 100 | 1.300000e+01 | -- | Inf
2.09/2.11 c 2.0s| 1 | 0 | 502 |1014k| 0 | 54 | 135 | 104 | 104 | 135 | 118 | 14 | 0 | 100 | 1.300000e+01 | -- | Inf
2.49/2.50 c 2.4s| 1 | 0 | 512 |1014k| 0 | 54 | 135 | 104 | 104 | 135 | 118 | 14 | 0 | 136 | 1.300000e+01 | -- | Inf
2.69/2.78 c 2.7s| 1 | 0 | 527 |1014k| 0 | 53 | 135 | 104 | 104 | 135 | 118 | 14 | 0 | 155 | 1.300000e+01 | -- | Inf
2.79/2.86 c 2.8s| 1 | 0 | 533 |1014k| 0 | 52 | 135 | 104 | 104 | 135 | 118 | 14 | 0 | 162 | 1.300000e+01 | -- | Inf
2.89/2.94 c 2.9s| 1 | 0 | 536 |1014k| 0 | 53 | 135 | 104 | 104 | 135 | 118 | 14 | 0 | 167 | 1.300000e+01 | -- | Inf
2.89/2.98 c 2.9s| 1 | 0 | 544 |1014k| 0 | 54 | 135 | 104 | 104 | 135 | 118 | 14 | 0 | 170 | 1.300000e+01 | -- | Inf
2.99/3.04 c [src/scip/lpi_spx.cpp:265] Warning: SoPlex threw an exception: XSOLVE21 Basis is singular (numerical troubles, delta = 1e-06)
2.99/3.04 c [src/scip/lpi_spx.cpp:1854] ERROR: SCIPlpiStrongbranch() returned SoPlex status -4
2.99/3.04 c (node 1) error in strong branching call for variable <t_x10> with solution 0.0103354
2.99/3.04 c 3.0s| 1 | 0 | 549 |1014k| 0 | 54 | 135 | 104 | 104 | 135 | 118 | 14 | 0 | 173 | 1.300000e+01 | -- | Inf
3.09/3.12 c 3.0s| 1 | 0 | 554 |1013k| 0 | 54 | 135 | 102 | 102 | 135 | 118 | 14 | 0 | 178 | 1.300000e+01 | -- | Inf
3.09/3.18 c 3.1s| 1 | 0 | 561 |1012k| 0 | 55 | 135 | 101 | 101 | 135 | 118 | 14 | 0 | 183 | 1.300000e+01 | -- | Inf
3.19/3.28 c 3.2s| 1 | 0 | 568 |1012k| 0 | 55 | 135 | 101 | 101 | 135 | 95 | 14 | 0 | 188 | 1.300000e+01 | -- | Inf
3.30/3.32 c 3.2s| 1 | 0 | 568 |1012k| 0 | - | 135 | 101 | 101 | 135 | 95 | 14 | 0 | 193 | 1.300000e+01 | -- | Inf
3.30/3.32 c (run 2, node 1) restarting after 30 global fixings of integer variables
3.30/3.32 c
3.30/3.32 (restart) converted 14 cuts from the global cut pool into linear constraints
3.30/3.32 c
3.30/3.32 presolving:
3.30/3.33 c (round 1) 30 del vars, 2 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 14 upgd conss, 32 impls, 85 clqs
3.30/3.34 c (round 2) 30 del vars, 6 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 14 upgd conss, 32 impls, 85 clqs
3.30/3.34 c presolving (3 rounds):
3.30/3.34 c 30 deleted vars, 6 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
3.30/3.34 c 32 implications, 85 cliques
3.30/3.34 c presolved problem has 105 variables (105 bin, 0 int, 0 impl, 0 cont) and 109 constraints
3.30/3.34 c 21 constraints of type <knapsack>
3.30/3.34 c 85 constraints of type <setppc>
3.30/3.34 c 3 constraints of type <logicor>
3.30/3.34 c transformed objective value is always integral (scale: 1)
3.30/3.34 c Presolving Time: 0.04
3.30/3.34 c
3.30/3.34 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
3.30/3.34 c 3.3s| 1 | 0 | 646 | 827k| 0 | 45 | 105 | 109 | 109 | 105 | 109 | 0 | 0 | 193 | 1.300000e+01 | -- | Inf
3.30/3.36 c 3.3s| 1 | 0 | 669 |1069k| 0 | 53 | 105 | 109 | 109 | 105 | 121 | 12 | 0 | 193 | 1.300000e+01 | -- | Inf
3.79/3.85 c 3.8s| 1 | 0 | 682 |1069k| 0 | 55 | 105 | 109 | 109 | 105 | 121 | 12 | 0 | 246 | 1.300000e+01 | -- | Inf
3.89/3.98 c 3.9s| 1 | 0 | 688 |1069k| 0 | 54 | 105 | 109 | 109 | 105 | 121 | 12 | 0 | 255 | 1.300000e+01 | -- | Inf
3.98/4.00 c 3.9s| 1 | 0 | 690 |1069k| 0 | 54 | 105 | 109 | 109 | 105 | 121 | 12 | 0 | 258 | 1.300000e+01 | -- | Inf
3.98/4.00 c 3.9s| 1 | 2 | 690 |1070k| 0 | 54 | 105 | 109 | 109 | 105 | 121 | 12 | 0 | 258 | 1.300000e+01 | -- | Inf
4.99/5.00 c
4.99/5.00 c SCIP Status : problem is solved [infeasible]
4.99/5.00 c Solving Time (sec) : 4.85
4.99/5.00 c Solving Nodes : 9 (total of 11 nodes in 3 runs)
4.99/5.00 c Primal Bound : +1.00000000000000e+20 (0 solutions)
4.99/5.00 c Dual Bound : +1.00000000000000e+20
4.99/5.00 c Gap : 0.00 %
4.99/5.00 c NODE 9
4.99/5.00 c DUAL BOUND 1e+20
4.99/5.00 c PRIMAL BOUND 1e+20
4.99/5.00 c GAP 0
4.99/5.00 s UNSATISFIABLE
4.99/5.00 c SCIP Status : problem is solved [infeasible]
4.99/5.00 c Solving Time : 4.85
4.99/5.00 c Original Problem :
4.99/5.00 c Problem name : HOME/instance-1868192-1245115926.opb
4.99/5.00 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
4.99/5.00 c Constraints : 101 initial, 101 maximal
4.99/5.00 c Presolved Problem :
4.99/5.00 c Problem name : t_HOME/instance-1868192-1245115926.opb
4.99/5.00 c Variables : 105 (105 binary, 0 integer, 0 implicit integer, 0 continuous)
4.99/5.00 c Constraints : 109 initial, 109 maximal
4.99/5.00 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
4.99/5.00 c trivial : 0.00 64 0 0 0 0 0 0 0
4.99/5.00 c dualfix : 0.00 0 0 0 0 0 0 0 0
4.99/5.00 c boundshift : 0.00 0 0 0 0 0 0 0 0
4.99/5.00 c inttobinary : 0.00 0 0 0 0 0 0 0 0
4.99/5.00 c implics : 0.00 0 0 0 0 0 0 0 0
4.99/5.00 c probing : 0.00 0 0 0 0 0 0 0 0
4.99/5.00 c knapsack : 0.02 0 0 0 0 0 0 0 0
4.99/5.00 c setppc : 0.00 0 0 0 0 0 6 0 0
4.99/5.00 c linear : 0.01 0 0 0 0 0 31 3 0
4.99/5.00 c logicor : 0.00 0 0 0 0 0 2 0 0
4.99/5.00 c root node : - 121 - - 121 - - - -
4.99/5.00 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
4.99/5.00 c integral : 0 0 0 54 0 4 162 0 0 8
4.99/5.00 c knapsack : 21 7 63 0 0 0 0 0 0 0
4.99/5.00 c setppc : 85 7 63 0 0 0 78 0 0 0
4.99/5.00 c logicor : 3+ 7 5 0 0 0 0 0 0 0
4.99/5.00 c countsols : 0 0 0 0 0 0 0 0 0 0
4.99/5.00 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
4.99/5.00 c integral : 4.56 0.00 0.00 4.56 0.00
4.99/5.00 c knapsack : 0.00 0.00 0.00 0.00 0.00
4.99/5.00 c setppc : 0.00 0.00 0.00 0.00 0.00
4.99/5.00 c logicor : 0.00 0.00 0.00 0.00 0.00
4.99/5.00 c countsols : 0.00 0.00 0.00 0.00 0.00
4.99/5.00 c Propagators : Time Calls Cutoffs DomReds
4.99/5.00 c rootredcost : 0.00 0 0 0
4.99/5.00 c pseudoobj : 0.01 66 0 0
4.99/5.00 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
4.99/5.00 c propagation : 0.00 0 0 0 0.0 0 0.0 -
4.99/5.00 c infeasible LP : 0.00 1 1 2 14.0 0 0.0 0
4.99/5.00 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
4.99/5.00 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
4.99/5.00 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
4.99/5.00 c applied globally : - - - 1 11.0 - - -
4.99/5.00 c applied locally : - - - 0 0.0 - - -
4.99/5.00 c Separators : Time Calls Cutoffs DomReds Cuts Conss
4.99/5.00 c cut pool : 0.00 0 - - 0 - (maximal pool size: 91)
4.99/5.00 c redcost : 0.00 15 0 0 0 0
4.99/5.00 c impliedbounds : 0.00 7 0 0 0 0
4.99/5.00 c intobj : 0.00 0 0 0 0 0
4.99/5.00 c gomory : 0.05 7 0 0 6 0
4.99/5.00 c strongcg : 0.06 7 0 0 289 0
4.99/5.00 c cmir : 0.00 0 0 0 0 0
4.99/5.00 c flowcover : 0.00 0 0 0 0 0
4.99/5.00 c clique : 0.00 7 0 0 39 0
4.99/5.00 c zerohalf : 0.00 0 0 0 0 0
4.99/5.00 c mcf : 0.00 3 0 0 0 0
4.99/5.00 c Pricers : Time Calls Vars
4.99/5.00 c problem variables: 0.00 0 0
4.99/5.00 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
4.99/5.00 c relpscost : 4.56 54 4 162 0 0 8
4.99/5.00 c pscost : 0.00 0 0 0 0 0 0
4.99/5.00 c inference : 0.00 0 0 0 0 0 0
4.99/5.00 c mostinf : 0.00 0 0 0 0 0 0
4.99/5.00 c leastinf : 0.00 0 0 0 0 0 0
4.99/5.00 c fullstrong : 0.00 0 0 0 0 0 0
4.99/5.00 c allfullstrong : 0.00 0 0 0 0 0 0
4.99/5.00 c random : 0.00 0 0 0 0 0 0
4.99/5.00 c Primal Heuristics : Time Calls Found
4.99/5.00 c LP solutions : 0.00 - 0
4.99/5.00 c pseudo solutions : 0.00 - 0
4.99/5.00 c simplerounding : 0.00 0 0
4.99/5.00 c rounding : 0.00 0 0
4.99/5.00 c shifting : 0.00 0 0
4.99/5.00 c intshifting : 0.00 0 0
4.99/5.00 c oneopt : 0.00 0 0
4.99/5.00 c fixandinfer : 0.00 0 0
4.99/5.00 c feaspump : 0.00 0 0
4.99/5.00 c coefdiving : 0.00 0 0
4.99/5.00 c pscostdiving : 0.00 0 0
4.99/5.00 c fracdiving : 0.00 0 0
4.99/5.00 c veclendiving : 0.00 0 0
4.99/5.00 c intdiving : 0.00 0 0
4.99/5.00 c actconsdiving : 0.00 0 0
4.99/5.00 c objpscostdiving : 0.00 0 0
4.99/5.00 c rootsoldiving : 0.00 0 0
4.99/5.00 c linesearchdiving : 0.00 0 0
4.99/5.00 c guideddiving : 0.00 0 0
4.99/5.00 c octane : 0.00 0 0
4.99/5.00 c rens : 0.00 0 0
4.99/5.00 c rins : 0.00 0 0
4.99/5.00 c localbranching : 0.00 0 0
4.99/5.00 c mutation : 0.00 0 0
4.99/5.00 c crossover : 0.00 0 0
4.99/5.00 c dins : 0.00 0 0
4.99/5.00 c LP : Time Calls Iterations Iter/call Iter/sec
4.99/5.00 c primal LP : 0.00 0 0 0.00 -
4.99/5.00 c dual LP : 0.11 62 1287 20.76 11700.00
4.99/5.00 c barrier LP : 0.00 0 0 0.00 -
4.99/5.00 c diving/probing LP: 0.00 0 0 0.00 -
4.99/5.00 c strong branching : 4.55 509 47893 94.09 10525.93
4.99/5.00 c (at root node) : - 258 33497 129.83 -
4.99/5.00 c conflict analysis: 0.00 0 0 0.00 -
4.99/5.00 c B&B Tree :
4.99/5.00 c number of runs : 3
4.99/5.00 c nodes : 9
4.99/5.00 c nodes (total) : 11
4.99/5.00 c nodes left : 0
4.99/5.00 c max depth : 4
4.99/5.00 c max depth (total): 4
4.99/5.00 c backtracks : 0 (0.0%)
4.99/5.00 c delayed cutoffs : 0
4.99/5.00 c repropagations : 2 (0 domain reductions, 0 cutoffs)
4.99/5.00 c avg switch length: 3.11
4.99/5.00 c switching time : 0.00
4.99/5.00 c Solution :
4.99/5.00 c Solutions found : 0 (0 improvements)
4.99/5.00 c Primal Bound : infeasible
4.99/5.00 c Dual Bound : -
4.99/5.00 c Gap : 0.00 %
4.99/5.00 c Root Dual Bound : +1.30000000000000e+01
4.99/5.01 c Time complete: 5.