0.00/0.00 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.00 c Copyright (c) 2002-2011 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-3453340-1307116761.opb>
0.59/0.64 c original problem has 29040 variables (29040 bin, 0 int, 0 impl, 0 cont) and 96434 constraints
0.59/0.64 c problem read
0.59/0.64 c No objective function, only one solution is needed.
0.59/0.64 c presolving settings loaded
0.89/0.96 c presolving:
2.79/2.83 c (round 1) 6687 del vars, 19660 del conss, 0 add conss, 4985 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 5359024 impls, 0 clqs
3.50/3.52 c (round 2) 14159 del vars, 48261 del conss, 0 add conss, 11986 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 5402729 impls, 0 clqs
3.60/3.64 c (round 3) 16664 del vars, 60179 del conss, 0 add conss, 13462 chg bounds, 16 chg sides, 25 chg coeffs, 0 upgd conss, 5416545 impls, 0 clqs
3.69/3.70 c (round 4) 17592 del vars, 63891 del conss, 0 add conss, 14105 chg bounds, 40 chg sides, 60 chg coeffs, 0 upgd conss, 5426135 impls, 0 clqs
3.69/3.75 c (round 5) 18275 del vars, 66177 del conss, 0 add conss, 14529 chg bounds, 42 chg sides, 67 chg coeffs, 0 upgd conss, 5434363 impls, 0 clqs
3.69/3.77 c (round 6) 18664 del vars, 67612 del conss, 0 add conss, 14750 chg bounds, 42 chg sides, 67 chg coeffs, 0 upgd conss, 5438491 impls, 0 clqs
3.69/3.80 c (round 7) 18912 del vars, 68445 del conss, 0 add conss, 14901 chg bounds, 42 chg sides, 67 chg coeffs, 0 upgd conss, 5441206 impls, 0 clqs
3.79/3.81 c (round 8) 19066 del vars, 69049 del conss, 0 add conss, 14975 chg bounds, 42 chg sides, 67 chg coeffs, 0 upgd conss, 5443218 impls, 0 clqs
3.79/3.83 c (round 9) 19184 del vars, 69434 del conss, 0 add conss, 15033 chg bounds, 42 chg sides, 67 chg coeffs, 0 upgd conss, 5445104 impls, 0 clqs
3.79/3.84 c (round 10) 19266 del vars, 69712 del conss, 0 add conss, 15078 chg bounds, 42 chg sides, 67 chg coeffs, 0 upgd conss, 5446164 impls, 0 clqs
3.79/3.85 c (round 11) 19309 del vars, 69889 del conss, 0 add conss, 15101 chg bounds, 42 chg sides, 67 chg coeffs, 0 upgd conss, 5446546 impls, 0 clqs
3.79/3.86 c (round 12) 19341 del vars, 70026 del conss, 0 add conss, 15110 chg bounds, 42 chg sides, 67 chg coeffs, 0 upgd conss, 5447066 impls, 0 clqs
3.79/3.87 c (round 13) 19346 del vars, 70056 del conss, 0 add conss, 15111 chg bounds, 42 chg sides, 67 chg coeffs, 0 upgd conss, 5447170 impls, 0 clqs
3.89/3.98 c (round 14) 19346 del vars, 70058 del conss, 0 add conss, 15111 chg bounds, 42 chg sides, 67 chg coeffs, 26376 upgd conss, 5447170 impls, 0 clqs
4.09/4.16 c (round 15) 19346 del vars, 70058 del conss, 0 add conss, 15111 chg bounds, 105 chg sides, 253 chg coeffs, 26376 upgd conss, 5447170 impls, 0 clqs
4.09/4.19 c (round 16) 19346 del vars, 70058 del conss, 0 add conss, 15111 chg bounds, 109 chg sides, 330 chg coeffs, 26376 upgd conss, 5447170 impls, 3 clqs
4.19/4.23 c presolving (17 rounds):
4.19/4.23 c 19346 deleted vars, 70058 deleted constraints, 0 added constraints, 15111 tightened bounds, 0 added holes, 111 changed sides, 364 changed coefficients
4.19/4.23 c 5447170 implications, 10 cliques
4.19/4.23 c presolved problem has 9694 variables (9694 bin, 0 int, 0 impl, 0 cont) and 26376 constraints
4.19/4.23 c 444 constraints of type <knapsack>
4.19/4.23 c 21414 constraints of type <setppc>
4.19/4.23 c 4518 constraints of type <logicor>
4.19/4.23 c transformed objective value is always integral (scale: 1)
4.19/4.23 c Presolving Time: 3.50
4.19/4.23 c - non default parameters ----------------------------------------------------------------------
4.19/4.23 c # SCIP version 2.0.1.4
4.19/4.23 c
4.19/4.23 c # frequency for displaying node information lines
4.19/4.23 c # [type: int, range: [-1,2147483647], default: 100]
4.19/4.23 c display/freq = 10000
4.19/4.23 c
4.19/4.23 c # maximal time in seconds to run
4.19/4.23 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
4.19/4.23 c limits/time = 1800
4.19/4.23 c
4.19/4.23 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
4.19/4.23 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
4.19/4.23 c limits/memory = 13950
4.19/4.23 c
4.19/4.23 c # solving stops, if the given number of solutions were found (-1: no limit)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: -1]
4.19/4.23 c limits/solutions = 1
4.19/4.23 c
4.19/4.23 c # maximal number of separation rounds per node (-1: unlimited)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: 5]
4.19/4.23 c separating/maxrounds = 1
4.19/4.23 c
4.19/4.23 c # maximal number of separation rounds in the root node (-1: unlimited)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: -1]
4.19/4.23 c separating/maxroundsroot = 5
4.19/4.23 c
4.19/4.23 c # default clock type (1: CPU user seconds, 2: wall clock time)
4.19/4.23 c # [type: int, range: [1,2], default: 1]
4.19/4.23 c timing/clocktype = 2
4.19/4.23 c
4.19/4.23 c # belongs reading time to solving time?
4.19/4.23 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.19/4.23 c timing/reading = TRUE
4.19/4.23 c
4.19/4.23 c # should presolving try to simplify inequalities
4.19/4.23 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.19/4.23 c constraints/linear/simplifyinequalities = TRUE
4.19/4.23 c
4.19/4.23 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
4.19/4.23 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.19/4.23 c constraints/indicator/addCouplingCons = TRUE
4.19/4.23 c
4.19/4.23 c # should disaggregation of knapsack constraints be allowed in preprocessing?
4.19/4.23 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
4.19/4.23 c constraints/knapsack/disaggregation = FALSE
4.19/4.23 c
4.19/4.23 c # should presolving try to simplify knapsacks
4.19/4.23 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.19/4.23 c constraints/knapsack/simplifyinequalities = TRUE
4.19/4.23 c
4.19/4.23 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: -1]
4.19/4.23 c presolving/probing/maxrounds = 0
4.19/4.23 c
4.19/4.23 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: 10]
4.19/4.23 c heuristics/coefdiving/freq = -1
4.19/4.23 c
4.19/4.23 c # maximal fraction of diving LP iterations compared to node LP iterations
4.19/4.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.19/4.23 c heuristics/coefdiving/maxlpiterquot = 0.075
4.19/4.23 c
4.19/4.23 c # additional number of allowed LP iterations
4.19/4.23 c # [type: int, range: [0,2147483647], default: 1000]
4.19/4.23 c heuristics/coefdiving/maxlpiterofs = 1500
4.19/4.23 c
4.19/4.23 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: 30]
4.19/4.23 c heuristics/crossover/freq = -1
4.19/4.23 c
4.19/4.23 c # number of nodes added to the contingent of the total nodes
4.19/4.23 c # [type: longint, range: [0,9223372036854775807], default: 500]
4.19/4.23 c heuristics/crossover/nodesofs = 750
4.19/4.23 c
4.19/4.23 c # number of nodes without incumbent change that heuristic should wait
4.19/4.23 c # [type: longint, range: [0,9223372036854775807], default: 200]
4.19/4.23 c heuristics/crossover/nwaitingnodes = 100
4.19/4.23 c
4.19/4.23 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
4.19/4.23 c # [type: real, range: [0,1], default: 0.1]
4.19/4.23 c heuristics/crossover/nodesquot = 0.15
4.19/4.23 c
4.19/4.23 c # minimum percentage of integer variables that have to be fixed
4.19/4.23 c # [type: real, range: [0,1], default: 0.666]
4.19/4.23 c heuristics/crossover/minfixingrate = 0.5
4.19/4.23 c
4.19/4.23 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: 20]
4.19/4.23 c heuristics/feaspump/freq = -1
4.19/4.23 c
4.19/4.23 c # additional number of allowed LP iterations
4.19/4.23 c # [type: int, range: [0,2147483647], default: 1000]
4.19/4.23 c heuristics/feaspump/maxlpiterofs = 2000
4.19/4.23 c
4.19/4.23 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: 10]
4.19/4.23 c heuristics/fracdiving/freq = -1
4.19/4.23 c
4.19/4.23 c # maximal fraction of diving LP iterations compared to node LP iterations
4.19/4.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.19/4.23 c heuristics/fracdiving/maxlpiterquot = 0.075
4.19/4.23 c
4.19/4.23 c # additional number of allowed LP iterations
4.19/4.23 c # [type: int, range: [0,2147483647], default: 1000]
4.19/4.23 c heuristics/fracdiving/maxlpiterofs = 1500
4.19/4.23 c
4.19/4.23 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: 10]
4.19/4.23 c heuristics/guideddiving/freq = -1
4.19/4.23 c
4.19/4.23 c # maximal fraction of diving LP iterations compared to node LP iterations
4.19/4.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.19/4.23 c heuristics/guideddiving/maxlpiterquot = 0.075
4.19/4.23 c
4.19/4.23 c # additional number of allowed LP iterations
4.19/4.23 c # [type: int, range: [0,2147483647], default: 1000]
4.19/4.23 c heuristics/guideddiving/maxlpiterofs = 1500
4.19/4.23 c
4.19/4.23 c # maximal fraction of diving LP iterations compared to node LP iterations
4.19/4.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.19/4.23 c heuristics/intdiving/maxlpiterquot = 0.075
4.19/4.23 c
4.19/4.23 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: 10]
4.19/4.23 c heuristics/intshifting/freq = -1
4.19/4.23 c
4.19/4.23 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: 10]
4.19/4.23 c heuristics/linesearchdiving/freq = -1
4.19/4.23 c
4.19/4.23 c # maximal fraction of diving LP iterations compared to node LP iterations
4.19/4.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.19/4.23 c heuristics/linesearchdiving/maxlpiterquot = 0.075
4.19/4.23 c
4.19/4.23 c # additional number of allowed LP iterations
4.19/4.23 c # [type: int, range: [0,2147483647], default: 1000]
4.19/4.23 c heuristics/linesearchdiving/maxlpiterofs = 1500
4.19/4.23 c
4.19/4.23 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: 20]
4.19/4.23 c heuristics/objpscostdiving/freq = -1
4.19/4.23 c
4.19/4.23 c # maximal fraction of diving LP iterations compared to total iteration number
4.19/4.23 c # [type: real, range: [0,1], default: 0.01]
4.19/4.23 c heuristics/objpscostdiving/maxlpiterquot = 0.015
4.19/4.23 c
4.19/4.23 c # additional number of allowed LP iterations
4.19/4.23 c # [type: int, range: [0,2147483647], default: 1000]
4.19/4.23 c heuristics/objpscostdiving/maxlpiterofs = 1500
4.19/4.23 c
4.19/4.23 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: 1]
4.19/4.23 c heuristics/oneopt/freq = -1
4.19/4.23 c
4.19/4.23 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: 10]
4.19/4.23 c heuristics/pscostdiving/freq = -1
4.19/4.23 c
4.19/4.23 c # maximal fraction of diving LP iterations compared to node LP iterations
4.19/4.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.19/4.23 c heuristics/pscostdiving/maxlpiterquot = 0.075
4.19/4.23 c
4.19/4.23 c # additional number of allowed LP iterations
4.19/4.23 c # [type: int, range: [0,2147483647], default: 1000]
4.19/4.23 c heuristics/pscostdiving/maxlpiterofs = 1500
4.19/4.23 c
4.19/4.23 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: 0]
4.19/4.23 c heuristics/rens/freq = -1
4.19/4.23 c
4.19/4.23 c # minimum percentage of integer variables that have to be fixable
4.19/4.23 c # [type: real, range: [0,1], default: 0.5]
4.19/4.23 c heuristics/rens/minfixingrate = 0.3
4.19/4.23 c
4.19/4.23 c # number of nodes added to the contingent of the total nodes
4.19/4.23 c # [type: longint, range: [0,9223372036854775807], default: 500]
4.19/4.23 c heuristics/rens/nodesofs = 2000
4.19/4.23 c
4.19/4.23 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: 20]
4.19/4.23 c heuristics/rootsoldiving/freq = -1
4.19/4.23 c
4.19/4.23 c # maximal fraction of diving LP iterations compared to node LP iterations
4.19/4.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
4.19/4.23 c heuristics/rootsoldiving/maxlpiterquot = 0.015
4.19/4.23 c
4.19/4.23 c # additional number of allowed LP iterations
4.19/4.23 c # [type: int, range: [0,2147483647], default: 1000]
4.19/4.23 c heuristics/rootsoldiving/maxlpiterofs = 1500
4.19/4.23 c
4.19/4.23 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: 1]
4.19/4.23 c heuristics/rounding/freq = -1
4.19/4.23 c
4.19/4.23 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: 0]
4.19/4.23 c heuristics/shiftandpropagate/freq = -1
4.19/4.23 c
4.19/4.23 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: 10]
4.19/4.23 c heuristics/shifting/freq = -1
4.19/4.23 c
4.19/4.23 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: 1]
4.19/4.23 c heuristics/simplerounding/freq = -1
4.19/4.23 c
4.19/4.23 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: 1]
4.19/4.23 c heuristics/subnlp/freq = -1
4.19/4.23 c
4.19/4.23 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: 0]
4.19/4.23 c heuristics/trivial/freq = -1
4.19/4.23 c
4.19/4.23 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: 1]
4.19/4.23 c heuristics/trysol/freq = -1
4.19/4.23 c
4.19/4.23 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: 0]
4.19/4.23 c heuristics/undercover/freq = -1
4.19/4.23 c
4.19/4.23 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: 10]
4.19/4.23 c heuristics/veclendiving/freq = -1
4.19/4.23 c
4.19/4.23 c # maximal fraction of diving LP iterations compared to node LP iterations
4.19/4.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.19/4.23 c heuristics/veclendiving/maxlpiterquot = 0.075
4.19/4.23 c
4.19/4.23 c # additional number of allowed LP iterations
4.19/4.23 c # [type: int, range: [0,2147483647], default: 1000]
4.19/4.23 c heuristics/veclendiving/maxlpiterofs = 1500
4.19/4.23 c
4.19/4.23 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: 1]
4.19/4.23 c heuristics/zirounding/freq = -1
4.19/4.23 c
4.19/4.23 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: 0]
4.19/4.23 c separating/cmir/freq = -1
4.19/4.23 c
4.19/4.23 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: 0]
4.19/4.23 c separating/flowcover/freq = -1
4.19/4.23 c
4.19/4.23 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
4.19/4.23 c # [type: int, range: [-1,2147483647], default: -1]
4.19/4.23 c separating/rapidlearning/freq = 0
4.19/4.23 c
4.19/4.23 c -----------------------------------------------------------------------------------------------
4.19/4.23 c start solving
4.19/4.23 c
58.98/59.10 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
58.98/59.10 c 59.1s| 1 | 0 | 29056 | - | 157M| 0 | - |9694 | 26k|9694 | 26k| 0 | 0 | 0 | cutoff | -- | 0.00%
58.98/59.10 c 59.1s| 1 | 0 | 29056 | - | 157M| 0 | - |9694 | 26k|9694 | 26k| 0 | 0 | 0 | cutoff | -- | 0.00%
58.98/59.10 c
58.98/59.10 c SCIP Status : problem is solved [infeasible]
58.98/59.10 c Solving Time (sec) : 59.09
58.98/59.10 c Solving Nodes : 1
58.98/59.10 c Primal Bound : +1.00000000000000e+20 (0 solutions)
58.98/59.10 c Dual Bound : +1.00000000000000e+20
58.98/59.10 c Gap : 0.00 %
58.98/59.10 s UNSATISFIABLE
58.98/59.10 c SCIP Status : problem is solved [infeasible]
58.98/59.10 c Total Time : 59.09
58.98/59.10 c solving : 59.09
58.98/59.10 c presolving : 3.50 (included in solving)
58.98/59.10 c reading : 0.64 (included in solving)
58.98/59.10 c Original Problem :
58.98/59.10 c Problem name : HOME/instance-3453340-1307116761.opb
58.98/59.10 c Variables : 29040 (29040 binary, 0 integer, 0 implicit integer, 0 continuous)
58.98/59.10 c Constraints : 96434 initial, 96434 maximal
58.98/59.10 c Presolved Problem :
58.98/59.10 c Problem name : t_HOME/instance-3453340-1307116761.opb
58.98/59.10 c Variables : 9694 (9694 binary, 0 integer, 0 implicit integer, 0 continuous)
58.98/59.10 c Constraints : 26376 initial, 26376 maximal
58.98/59.10 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
58.98/59.10 c trivial : 0.01 864 0 0 0 0 0 0 0 0
58.98/59.10 c dualfix : 0.02 111 0 0 0 0 0 0 0 0
58.98/59.10 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
58.98/59.10 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
58.98/59.10 c implics : 0.06 0 0 0 0 0 0 0 0 0
58.98/59.10 c probing : 0.00 0 0 0 0 0 0 0 0 0
58.98/59.10 c knapsack : 0.15 0 0 0 0 0 0 0 69 297
58.98/59.10 c setppc : 0.06 0 0 0 0 0 0 0 0 0
58.98/59.10 c linear : 2.87 14253 4118 0 15111 0 70058 0 42 67
58.98/59.10 c logicor : 0.03 0 0 0 0 0 0 0 0 0
58.98/59.10 c root node : - 0 - - 0 - - - - -
58.98/59.10 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
58.98/59.10 c integral : 0 0 0 0 0 0 0 0 0 0 0 0
58.98/59.10 c knapsack : 444 0 1 0 0 0 0 0 0 0 0 0
58.98/59.10 c setppc : 21414 0 1 0 0 0 0 0 0 0 0 0
58.98/59.10 c logicor : 4518 0 1 0 0 0 0 0 0 0 0 0
58.98/59.10 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
58.98/59.10 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
58.98/59.10 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
58.98/59.10 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
58.98/59.10 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
58.98/59.10 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
58.98/59.10 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
58.98/59.10 c Propagators : #Propagate #Resprop Cutoffs DomReds
58.98/59.10 c vbounds : 0 0 0 0
58.98/59.10 c rootredcost : 0 0 0 0
58.98/59.10 c pseudoobj : 0 0 0 0
58.98/59.10 c Propagator Timings : TotalTime Propagate Resprop
58.98/59.10 c vbounds : 0.00 0.00 0.00
58.98/59.10 c rootredcost : 0.00 0.00 0.00
58.98/59.10 c pseudoobj : 0.00 0.00 0.00
58.98/59.10 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
58.98/59.10 c propagation : 0.00 0 0 0 0.0 0 0.0 -
58.98/59.10 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
58.98/59.10 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
59.08/59.10 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
59.08/59.10 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
59.08/59.10 c applied globally : - - - 0 0.0 - - -
59.08/59.10 c applied locally : - - - 0 0.0 - - -
59.08/59.10 c Separators : Time Calls Cutoffs DomReds Cuts Conss
59.08/59.10 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
59.08/59.10 c redcost : 0.00 0 0 0 0 0
59.08/59.10 c impliedbounds : 0.00 0 0 0 0 0
59.08/59.10 c intobj : 0.00 0 0 0 0 0
59.08/59.10 c gomory : 0.00 0 0 0 0 0
59.08/59.10 c cgmip : 0.00 0 0 0 0 0
59.08/59.10 c closecuts : 0.00 0 0 0 0 0
59.08/59.10 c strongcg : 0.00 0 0 0 0 0
59.08/59.10 c cmir : 0.00 0 0 0 0 0
59.08/59.10 c flowcover : 0.00 0 0 0 0 0
59.08/59.10 c clique : 0.00 0 0 0 0 0
59.08/59.10 c zerohalf : 0.00 0 0 0 0 0
59.08/59.10 c mcf : 0.00 0 0 0 0 0
59.08/59.10 c oddcycle : 0.00 0 0 0 0 0
59.08/59.10 c rapidlearning : 0.00 0 0 0 0 0
59.08/59.10 c Pricers : Time Calls Vars
59.08/59.10 c problem variables: 0.00 0 0
59.08/59.10 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
59.08/59.10 c pscost : 0.00 0 0 0 0 0 0
59.08/59.10 c inference : 0.00 0 0 0 0 0 0
59.08/59.10 c mostinf : 0.00 0 0 0 0 0 0
59.08/59.10 c leastinf : 0.00 0 0 0 0 0 0
59.08/59.10 c fullstrong : 0.00 0 0 0 0 0 0
59.08/59.10 c allfullstrong : 0.00 0 0 0 0 0 0
59.08/59.10 c random : 0.00 0 0 0 0 0 0
59.08/59.10 c relpscost : 0.00 0 0 0 0 0 0
59.08/59.10 c Primal Heuristics : Time Calls Found
59.08/59.10 c LP solutions : 0.00 - 0
59.08/59.10 c pseudo solutions : 0.00 - 0
59.08/59.10 c trivial : 0.02 1 0
59.08/59.10 c shiftandpropagate: 0.00 0 0
59.08/59.10 c simplerounding : 0.00 0 0
59.08/59.10 c zirounding : 0.00 0 0
59.08/59.10 c rounding : 0.00 0 0
59.08/59.10 c shifting : 0.00 0 0
59.08/59.10 c intshifting : 0.00 0 0
59.08/59.10 c oneopt : 0.00 0 0
59.08/59.10 c twoopt : 0.00 0 0
59.08/59.10 c fixandinfer : 0.00 0 0
59.08/59.10 c feaspump : 0.00 0 0
59.08/59.10 c clique : 0.00 0 0
59.08/59.10 c coefdiving : 0.00 0 0
59.08/59.10 c pscostdiving : 0.00 0 0
59.08/59.10 c fracdiving : 0.00 0 0
59.08/59.10 c veclendiving : 0.00 0 0
59.08/59.10 c intdiving : 0.00 0 0
59.08/59.10 c actconsdiving : 0.00 0 0
59.08/59.10 c objpscostdiving : 0.00 0 0
59.08/59.10 c rootsoldiving : 0.00 0 0
59.08/59.10 c linesearchdiving : 0.00 0 0
59.08/59.10 c guideddiving : 0.00 0 0
59.08/59.10 c octane : 0.00 0 0
59.08/59.10 c rens : 0.00 0 0
59.08/59.10 c rins : 0.00 0 0
59.08/59.10 c localbranching : 0.00 0 0
59.08/59.10 c mutation : 0.00 0 0
59.08/59.10 c crossover : 0.00 0 0
59.08/59.10 c dins : 0.00 0 0
59.08/59.10 c vbounds : 0.00 0 0
59.08/59.10 c undercover : 0.00 0 0
59.08/59.10 c subnlp : 0.00 0 0
59.08/59.10 c trysol : 0.00 0 0
59.08/59.10 c LP : Time Calls Iterations Iter/call Iter/sec
59.08/59.10 c primal LP : 0.00 0 0 0.00 -
59.08/59.10 c dual LP : 54.80 1 29056 29056.00 530.22
59.08/59.10 c lex dual LP : 0.00 0 0 0.00 -
59.08/59.10 c barrier LP : 0.00 0 0 0.00 -
59.08/59.10 c diving/probing LP: 0.00 0 0 0.00 -
59.08/59.10 c strong branching : 0.00 0 0 0.00 -
59.08/59.10 c (at root node) : - 0 0 0.00 -
59.08/59.10 c conflict analysis: 0.00 0 0 0.00 -
59.08/59.10 c B&B Tree :
59.08/59.10 c number of runs : 1
59.08/59.10 c nodes : 1
59.08/59.10 c nodes (total) : 1
59.08/59.10 c nodes left : 0
59.08/59.10 c max depth : 0
59.08/59.10 c max depth (total): 0
59.08/59.10 c backtracks : 0 (0.0%)
59.08/59.10 c delayed cutoffs : 0
59.08/59.10 c repropagations : 0 (0 domain reductions, 0 cutoffs)
59.08/59.10 c avg switch length: 2.00
59.08/59.10 c switching time : 0.00
59.08/59.10 c Solution :
59.08/59.10 c Solutions found : 0 (0 improvements)
59.08/59.10 c Primal Bound : infeasible
59.08/59.10 c Dual Bound : -
59.08/59.10 c Gap : 0.00 %
59.08/59.10 c Root Dual Bound : -
59.08/59.10 c Root Iterations : 29056
59.18/59.25 c Time complete: 59.23.