0.00/0.00 c SCIP version 2.0.1.5 [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-3451683-1307116125.opb>
0.59/0.69 c original problem has 30492 variables (30492 bin, 0 int, 0 impl, 0 cont) and 105829 constraints
0.59/0.69 c problem read
0.59/0.69 c No objective function, only one solution is needed.
0.59/0.69 c presolving settings loaded
0.79/0.88 c presolving:
2.89/2.95 c (round 1) 7419 del vars, 21344 del conss, 0 add conss, 5855 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 5855558 impls, 0 clqs
3.59/3.64 c (round 2) 13940 del vars, 50899 del conss, 0 add conss, 11845 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 5904630 impls, 0 clqs
3.79/3.81 c (round 3) 17171 del vars, 64625 del conss, 0 add conss, 14113 chg bounds, 44 chg sides, 20 chg coeffs, 0 upgd conss, 5923632 impls, 0 clqs
3.89/3.90 c (round 4) 18596 del vars, 70085 del conss, 0 add conss, 15190 chg bounds, 59 chg sides, 35 chg coeffs, 0 upgd conss, 5938283 impls, 0 clqs
3.89/3.95 c (round 5) 19605 del vars, 73640 del conss, 0 add conss, 15863 chg bounds, 61 chg sides, 37 chg coeffs, 0 upgd conss, 5947940 impls, 0 clqs
3.89/3.98 c (round 6) 20118 del vars, 75565 del conss, 0 add conss, 16185 chg bounds, 61 chg sides, 37 chg coeffs, 0 upgd conss, 5953442 impls, 0 clqs
3.99/4.00 c (round 7) 20446 del vars, 76783 del conss, 0 add conss, 16387 chg bounds, 61 chg sides, 37 chg coeffs, 0 upgd conss, 5956441 impls, 0 clqs
3.99/4.02 c (round 8) 20638 del vars, 77543 del conss, 0 add conss, 16484 chg bounds, 61 chg sides, 37 chg coeffs, 0 upgd conss, 5958002 impls, 0 clqs
3.99/4.03 c (round 9) 20710 del vars, 77866 del conss, 0 add conss, 16525 chg bounds, 61 chg sides, 37 chg coeffs, 0 upgd conss, 5958292 impls, 0 clqs
3.99/4.04 c (round 10) 20740 del vars, 77986 del conss, 0 add conss, 16541 chg bounds, 61 chg sides, 37 chg coeffs, 0 upgd conss, 5958500 impls, 0 clqs
3.99/4.04 c (round 11) 20752 del vars, 78039 del conss, 0 add conss, 16546 chg bounds, 61 chg sides, 37 chg coeffs, 0 upgd conss, 5958552 impls, 0 clqs
3.99/4.05 c (round 12) 20752 del vars, 78047 del conss, 0 add conss, 16546 chg bounds, 61 chg sides, 37 chg coeffs, 0 upgd conss, 5958552 impls, 0 clqs
4.09/4.17 c (round 13) 20752 del vars, 78047 del conss, 0 add conss, 16546 chg bounds, 61 chg sides, 37 chg coeffs, 27782 upgd conss, 5958552 impls, 0 clqs
4.19/4.26 c (round 14) 20752 del vars, 78047 del conss, 0 add conss, 16546 chg bounds, 78 chg sides, 123 chg coeffs, 27782 upgd conss, 5959426 impls, 372 clqs
4.30/4.32 c (round 15) 20752 del vars, 78047 del conss, 0 add conss, 16546 chg bounds, 81 chg sides, 138 chg coeffs, 27782 upgd conss, 5959426 impls, 442 clqs
4.30/4.36 c presolving (16 rounds):
4.30/4.36 c 20752 deleted vars, 78047 deleted constraints, 0 added constraints, 16546 tightened bounds, 0 added holes, 81 changed sides, 138 changed coefficients
4.30/4.36 c 5959426 implications, 443 cliques
4.30/4.36 c presolved problem has 9740 variables (9740 bin, 0 int, 0 impl, 0 cont) and 27782 constraints
4.30/4.36 c 448 constraints of type <knapsack>
4.30/4.36 c 22801 constraints of type <setppc>
4.30/4.36 c 4533 constraints of type <logicor>
4.30/4.36 c transformed objective value is always integral (scale: 1)
4.30/4.36 c Presolving Time: 3.53
4.30/4.36 c - non default parameters ----------------------------------------------------------------------
4.30/4.36 c # SCIP version 2.0.1.5
4.30/4.36 c
4.30/4.36 c # frequency for displaying node information lines
4.30/4.36 c # [type: int, range: [-1,2147483647], default: 100]
4.30/4.36 c display/freq = 10000
4.30/4.36 c
4.30/4.36 c # maximal time in seconds to run
4.30/4.36 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
4.30/4.36 c limits/time = 1800
4.30/4.36 c
4.30/4.36 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
4.30/4.36 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
4.30/4.36 c limits/memory = 13950
4.30/4.36 c
4.30/4.36 c # solving stops, if the given number of solutions were found (-1: no limit)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: -1]
4.30/4.36 c limits/solutions = 1
4.30/4.36 c
4.30/4.36 c # maximal number of separation rounds per node (-1: unlimited)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: 5]
4.30/4.36 c separating/maxrounds = 1
4.30/4.36 c
4.30/4.36 c # maximal number of separation rounds in the root node (-1: unlimited)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: -1]
4.30/4.36 c separating/maxroundsroot = 5
4.30/4.36 c
4.30/4.36 c # default clock type (1: CPU user seconds, 2: wall clock time)
4.30/4.36 c # [type: int, range: [1,2], default: 1]
4.30/4.36 c timing/clocktype = 2
4.30/4.36 c
4.30/4.36 c # belongs reading time to solving time?
4.30/4.36 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.30/4.36 c timing/reading = TRUE
4.30/4.36 c
4.30/4.36 c # should presolving try to simplify inequalities
4.30/4.36 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.30/4.36 c constraints/linear/simplifyinequalities = TRUE
4.30/4.36 c
4.30/4.36 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
4.30/4.36 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.30/4.36 c constraints/indicator/addCouplingCons = TRUE
4.30/4.36 c
4.30/4.36 c # should disaggregation of knapsack constraints be allowed in preprocessing?
4.30/4.36 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
4.30/4.36 c constraints/knapsack/disaggregation = FALSE
4.30/4.36 c
4.30/4.36 c # should presolving try to simplify knapsacks
4.30/4.36 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.30/4.36 c constraints/knapsack/simplifyinequalities = TRUE
4.30/4.36 c
4.30/4.36 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: -1]
4.30/4.36 c presolving/probing/maxrounds = 0
4.30/4.36 c
4.30/4.36 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: 10]
4.30/4.36 c heuristics/coefdiving/freq = -1
4.30/4.36 c
4.30/4.36 c # maximal fraction of diving LP iterations compared to node LP iterations
4.30/4.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.30/4.36 c heuristics/coefdiving/maxlpiterquot = 0.075
4.30/4.36 c
4.30/4.36 c # additional number of allowed LP iterations
4.30/4.36 c # [type: int, range: [0,2147483647], default: 1000]
4.30/4.36 c heuristics/coefdiving/maxlpiterofs = 1500
4.30/4.36 c
4.30/4.36 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: 30]
4.30/4.36 c heuristics/crossover/freq = -1
4.30/4.36 c
4.30/4.36 c # number of nodes added to the contingent of the total nodes
4.30/4.36 c # [type: longint, range: [0,9223372036854775807], default: 500]
4.30/4.36 c heuristics/crossover/nodesofs = 750
4.30/4.36 c
4.30/4.36 c # number of nodes without incumbent change that heuristic should wait
4.30/4.36 c # [type: longint, range: [0,9223372036854775807], default: 200]
4.30/4.36 c heuristics/crossover/nwaitingnodes = 100
4.30/4.36 c
4.30/4.36 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
4.30/4.36 c # [type: real, range: [0,1], default: 0.1]
4.30/4.36 c heuristics/crossover/nodesquot = 0.15
4.30/4.36 c
4.30/4.36 c # minimum percentage of integer variables that have to be fixed
4.30/4.36 c # [type: real, range: [0,1], default: 0.666]
4.30/4.36 c heuristics/crossover/minfixingrate = 0.5
4.30/4.36 c
4.30/4.36 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: 20]
4.30/4.36 c heuristics/feaspump/freq = -1
4.30/4.36 c
4.30/4.36 c # additional number of allowed LP iterations
4.30/4.36 c # [type: int, range: [0,2147483647], default: 1000]
4.30/4.36 c heuristics/feaspump/maxlpiterofs = 2000
4.30/4.36 c
4.30/4.36 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: 10]
4.30/4.36 c heuristics/fracdiving/freq = -1
4.30/4.36 c
4.30/4.36 c # maximal fraction of diving LP iterations compared to node LP iterations
4.30/4.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.30/4.36 c heuristics/fracdiving/maxlpiterquot = 0.075
4.30/4.36 c
4.30/4.36 c # additional number of allowed LP iterations
4.30/4.36 c # [type: int, range: [0,2147483647], default: 1000]
4.30/4.36 c heuristics/fracdiving/maxlpiterofs = 1500
4.30/4.36 c
4.30/4.36 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: 10]
4.30/4.36 c heuristics/guideddiving/freq = -1
4.30/4.36 c
4.30/4.36 c # maximal fraction of diving LP iterations compared to node LP iterations
4.30/4.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.30/4.36 c heuristics/guideddiving/maxlpiterquot = 0.075
4.30/4.36 c
4.30/4.36 c # additional number of allowed LP iterations
4.30/4.36 c # [type: int, range: [0,2147483647], default: 1000]
4.30/4.36 c heuristics/guideddiving/maxlpiterofs = 1500
4.30/4.36 c
4.30/4.36 c # maximal fraction of diving LP iterations compared to node LP iterations
4.30/4.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.30/4.36 c heuristics/intdiving/maxlpiterquot = 0.075
4.30/4.36 c
4.30/4.36 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: 10]
4.30/4.36 c heuristics/intshifting/freq = -1
4.30/4.36 c
4.30/4.36 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: 10]
4.30/4.36 c heuristics/linesearchdiving/freq = -1
4.30/4.36 c
4.30/4.36 c # maximal fraction of diving LP iterations compared to node LP iterations
4.30/4.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.30/4.36 c heuristics/linesearchdiving/maxlpiterquot = 0.075
4.30/4.36 c
4.30/4.36 c # additional number of allowed LP iterations
4.30/4.36 c # [type: int, range: [0,2147483647], default: 1000]
4.30/4.36 c heuristics/linesearchdiving/maxlpiterofs = 1500
4.30/4.36 c
4.30/4.36 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: 20]
4.30/4.36 c heuristics/objpscostdiving/freq = -1
4.30/4.36 c
4.30/4.36 c # maximal fraction of diving LP iterations compared to total iteration number
4.30/4.36 c # [type: real, range: [0,1], default: 0.01]
4.30/4.36 c heuristics/objpscostdiving/maxlpiterquot = 0.015
4.30/4.36 c
4.30/4.36 c # additional number of allowed LP iterations
4.30/4.36 c # [type: int, range: [0,2147483647], default: 1000]
4.30/4.36 c heuristics/objpscostdiving/maxlpiterofs = 1500
4.30/4.36 c
4.30/4.36 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: 1]
4.30/4.36 c heuristics/oneopt/freq = -1
4.30/4.36 c
4.30/4.36 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: 10]
4.30/4.36 c heuristics/pscostdiving/freq = -1
4.30/4.36 c
4.30/4.36 c # maximal fraction of diving LP iterations compared to node LP iterations
4.30/4.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.30/4.36 c heuristics/pscostdiving/maxlpiterquot = 0.075
4.30/4.36 c
4.30/4.36 c # additional number of allowed LP iterations
4.30/4.36 c # [type: int, range: [0,2147483647], default: 1000]
4.30/4.36 c heuristics/pscostdiving/maxlpiterofs = 1500
4.30/4.36 c
4.30/4.36 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: 0]
4.30/4.36 c heuristics/rens/freq = -1
4.30/4.36 c
4.30/4.36 c # minimum percentage of integer variables that have to be fixable
4.30/4.36 c # [type: real, range: [0,1], default: 0.5]
4.30/4.36 c heuristics/rens/minfixingrate = 0.3
4.30/4.36 c
4.30/4.36 c # number of nodes added to the contingent of the total nodes
4.30/4.36 c # [type: longint, range: [0,9223372036854775807], default: 500]
4.30/4.36 c heuristics/rens/nodesofs = 2000
4.30/4.36 c
4.30/4.36 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: 20]
4.30/4.36 c heuristics/rootsoldiving/freq = -1
4.30/4.36 c
4.30/4.36 c # maximal fraction of diving LP iterations compared to node LP iterations
4.30/4.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
4.30/4.36 c heuristics/rootsoldiving/maxlpiterquot = 0.015
4.30/4.36 c
4.30/4.36 c # additional number of allowed LP iterations
4.30/4.36 c # [type: int, range: [0,2147483647], default: 1000]
4.30/4.36 c heuristics/rootsoldiving/maxlpiterofs = 1500
4.30/4.36 c
4.30/4.36 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: 1]
4.30/4.36 c heuristics/rounding/freq = -1
4.30/4.36 c
4.30/4.36 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: 0]
4.30/4.36 c heuristics/shiftandpropagate/freq = -1
4.30/4.36 c
4.30/4.36 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: 10]
4.30/4.36 c heuristics/shifting/freq = -1
4.30/4.36 c
4.30/4.36 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: 1]
4.30/4.36 c heuristics/simplerounding/freq = -1
4.30/4.36 c
4.30/4.36 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: 1]
4.30/4.36 c heuristics/subnlp/freq = -1
4.30/4.36 c
4.30/4.36 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: 0]
4.30/4.36 c heuristics/trivial/freq = -1
4.30/4.36 c
4.30/4.36 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: 1]
4.30/4.36 c heuristics/trysol/freq = -1
4.30/4.36 c
4.30/4.36 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: 0]
4.30/4.36 c heuristics/undercover/freq = -1
4.30/4.36 c
4.30/4.36 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: 10]
4.30/4.36 c heuristics/veclendiving/freq = -1
4.30/4.36 c
4.30/4.36 c # maximal fraction of diving LP iterations compared to node LP iterations
4.30/4.36 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.30/4.36 c heuristics/veclendiving/maxlpiterquot = 0.075
4.30/4.36 c
4.30/4.36 c # additional number of allowed LP iterations
4.30/4.36 c # [type: int, range: [0,2147483647], default: 1000]
4.30/4.36 c heuristics/veclendiving/maxlpiterofs = 1500
4.30/4.36 c
4.30/4.36 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: 1]
4.30/4.36 c heuristics/zirounding/freq = -1
4.30/4.36 c
4.30/4.36 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: 0]
4.30/4.36 c separating/cmir/freq = -1
4.30/4.36 c
4.30/4.36 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: 0]
4.30/4.36 c separating/flowcover/freq = -1
4.30/4.36 c
4.30/4.36 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
4.30/4.36 c # [type: int, range: [-1,2147483647], default: -1]
4.30/4.36 c separating/rapidlearning/freq = 0
4.30/4.36 c
4.30/4.36 c -----------------------------------------------------------------------------------------------
4.30/4.36 c start solving
4.30/4.36 c
61.46/61.53 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
61.46/61.53 c 61.5s| 1 | 0 | 28781 | - | 172M| 0 | - |9740 | 27k|9740 | 27k| 0 | 0 | 0 | cutoff | -- | 0.00%
61.46/61.53 c 61.5s| 1 | 0 | 28781 | - | 172M| 0 | - |9740 | 27k|9740 | 27k| 0 | 0 | 0 | cutoff | -- | 0.00%
61.46/61.53 c
61.46/61.53 c SCIP Status : problem is solved [infeasible]
61.46/61.53 c Solving Time (sec) : 61.53
61.46/61.53 c Solving Nodes : 1
61.46/61.53 c Primal Bound : +1.00000000000000e+20 (0 solutions)
61.46/61.53 c Dual Bound : +1.00000000000000e+20
61.46/61.53 c Gap : 0.00 %
61.46/61.53 s UNSATISFIABLE
61.46/61.53 c SCIP Status : problem is solved [infeasible]
61.46/61.53 c Total Time : 61.53
61.46/61.53 c solving : 61.53
61.46/61.53 c presolving : 3.53 (included in solving)
61.46/61.53 c reading : 0.69 (included in solving)
61.46/61.53 c Original Problem :
61.46/61.53 c Problem name : HOME/instance-3451683-1307116125.opb
61.46/61.53 c Variables : 30492 (30492 binary, 0 integer, 0 implicit integer, 0 continuous)
61.46/61.53 c Constraints : 105829 initial, 105829 maximal
61.46/61.53 c Presolved Problem :
61.46/61.53 c Problem name : t_HOME/instance-3451683-1307116125.opb
61.46/61.53 c Variables : 9740 (9740 binary, 0 integer, 0 implicit integer, 0 continuous)
61.46/61.53 c Constraints : 27782 initial, 27782 maximal
61.46/61.53 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
61.46/61.53 c trivial : 0.01 879 0 0 0 0 0 0 0 0
61.46/61.53 c dualfix : 0.02 111 0 0 0 0 0 0 0 0
61.46/61.53 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
61.46/61.53 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
61.46/61.53 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
61.46/61.53 c implics : 0.06 0 0 0 0 0 0 0 0 0
61.46/61.53 c probing : 0.00 0 0 0 0 0 0 0 0 0
61.46/61.53 c knapsack : 0.09 0 0 0 0 0 0 0 20 101
61.46/61.53 c setppc : 0.06 0 0 0 0 0 0 0 0 0
61.46/61.53 c linear : 3.11 15667 4095 0 16546 0 78047 0 61 37
61.46/61.53 c logicor : 0.04 0 0 0 0 0 0 0 0 0
61.46/61.53 c root node : - 0 - - 0 - - - - -
61.46/61.53 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
61.46/61.53 c integral : 0 0 0 0 0 0 0 0 0 0 0 0
61.46/61.53 c knapsack : 448 0 1 0 0 0 0 0 0 0 0 0
61.46/61.53 c setppc : 22801 0 1 0 0 0 0 0 0 0 0 0
61.46/61.53 c logicor : 4533 0 1 0 0 0 0 0 0 0 0 0
61.46/61.53 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
61.46/61.53 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
61.46/61.53 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
61.46/61.53 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
61.46/61.53 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
61.46/61.53 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
61.46/61.53 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
61.46/61.53 c Propagators : #Propagate #Resprop Cutoffs DomReds
61.46/61.53 c vbounds : 0 0 0 0
61.46/61.53 c rootredcost : 0 0 0 0
61.46/61.53 c pseudoobj : 0 0 0 0
61.46/61.53 c Propagator Timings : TotalTime Propagate Resprop
61.46/61.53 c vbounds : 0.00 0.00 0.00
61.46/61.53 c rootredcost : 0.00 0.00 0.00
61.46/61.53 c pseudoobj : 0.00 0.00 0.00
61.46/61.53 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
61.46/61.53 c propagation : 0.00 0 0 0 0.0 0 0.0 -
61.46/61.53 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
61.46/61.53 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
61.46/61.53 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
61.46/61.53 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
61.46/61.53 c applied globally : - - - 0 0.0 - - -
61.46/61.53 c applied locally : - - - 0 0.0 - - -
61.46/61.53 c Separators : Time Calls Cutoffs DomReds Cuts Conss
61.46/61.53 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
61.46/61.53 c redcost : 0.00 0 0 0 0 0
61.46/61.53 c impliedbounds : 0.00 0 0 0 0 0
61.46/61.53 c intobj : 0.00 0 0 0 0 0
61.46/61.53 c gomory : 0.00 0 0 0 0 0
61.46/61.53 c cgmip : 0.00 0 0 0 0 0
61.46/61.53 c closecuts : 0.00 0 0 0 0 0
61.46/61.53 c strongcg : 0.00 0 0 0 0 0
61.46/61.53 c cmir : 0.00 0 0 0 0 0
61.46/61.53 c flowcover : 0.00 0 0 0 0 0
61.46/61.53 c clique : 0.00 0 0 0 0 0
61.46/61.53 c zerohalf : 0.00 0 0 0 0 0
61.46/61.53 c mcf : 0.00 0 0 0 0 0
61.46/61.53 c oddcycle : 0.00 0 0 0 0 0
61.46/61.53 c rapidlearning : 0.00 0 0 0 0 0
61.46/61.53 c Pricers : Time Calls Vars
61.46/61.53 c problem variables: 0.00 0 0
61.46/61.53 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
61.46/61.53 c pscost : 0.00 0 0 0 0 0 0
61.46/61.53 c inference : 0.00 0 0 0 0 0 0
61.46/61.53 c mostinf : 0.00 0 0 0 0 0 0
61.46/61.53 c leastinf : 0.00 0 0 0 0 0 0
61.46/61.53 c fullstrong : 0.00 0 0 0 0 0 0
61.46/61.53 c allfullstrong : 0.00 0 0 0 0 0 0
61.46/61.53 c random : 0.00 0 0 0 0 0 0
61.46/61.53 c relpscost : 0.00 0 0 0 0 0 0
61.46/61.53 c Primal Heuristics : Time Calls Found
61.46/61.53 c LP solutions : 0.00 - 0
61.46/61.53 c pseudo solutions : 0.00 - 0
61.46/61.53 c trivial : 0.02 1 0
61.46/61.53 c shiftandpropagate: 0.00 0 0
61.46/61.53 c simplerounding : 0.00 0 0
61.46/61.53 c zirounding : 0.00 0 0
61.46/61.53 c rounding : 0.00 0 0
61.46/61.53 c shifting : 0.00 0 0
61.46/61.53 c intshifting : 0.00 0 0
61.46/61.53 c oneopt : 0.00 0 0
61.46/61.53 c twoopt : 0.00 0 0
61.46/61.53 c fixandinfer : 0.00 0 0
61.46/61.53 c feaspump : 0.00 0 0
61.46/61.53 c clique : 0.00 0 0
61.46/61.53 c coefdiving : 0.00 0 0
61.46/61.53 c pscostdiving : 0.00 0 0
61.46/61.53 c fracdiving : 0.00 0 0
61.46/61.53 c veclendiving : 0.00 0 0
61.46/61.53 c intdiving : 0.00 0 0
61.46/61.53 c actconsdiving : 0.00 0 0
61.46/61.53 c objpscostdiving : 0.00 0 0
61.46/61.53 c rootsoldiving : 0.00 0 0
61.46/61.53 c linesearchdiving : 0.00 0 0
61.46/61.53 c guideddiving : 0.00 0 0
61.46/61.53 c octane : 0.00 0 0
61.46/61.53 c rens : 0.00 0 0
61.46/61.53 c rins : 0.00 0 0
61.46/61.53 c localbranching : 0.00 0 0
61.46/61.53 c mutation : 0.00 0 0
61.46/61.53 c crossover : 0.00 0 0
61.46/61.53 c dins : 0.00 0 0
61.46/61.53 c vbounds : 0.00 0 0
61.46/61.53 c undercover : 0.00 0 0
61.46/61.53 c subnlp : 0.00 0 0
61.46/61.53 c trysol : 0.00 0 0
61.46/61.53 c LP : Time Calls Iterations Iter/call Iter/sec
61.46/61.53 c primal LP : 0.00 0 0 0.00 -
61.46/61.53 c dual LP : 57.11 1 28781 28781.00 503.97
61.46/61.53 c lex dual LP : 0.00 0 0 0.00 -
61.46/61.53 c barrier LP : 0.00 0 0 0.00 -
61.46/61.53 c diving/probing LP: 0.00 0 0 0.00 -
61.46/61.53 c strong branching : 0.00 0 0 0.00 -
61.46/61.53 c (at root node) : - 0 0 0.00 -
61.46/61.53 c conflict analysis: 0.00 0 0 0.00 -
61.46/61.53 c B&B Tree :
61.46/61.53 c number of runs : 1
61.46/61.53 c nodes : 1
61.46/61.53 c nodes (total) : 1
61.46/61.53 c nodes left : 0
61.46/61.53 c max depth : 0
61.46/61.53 c max depth (total): 0
61.46/61.53 c backtracks : 0 (0.0%)
61.46/61.53 c delayed cutoffs : 0
61.46/61.53 c repropagations : 0 (0 domain reductions, 0 cutoffs)
61.46/61.53 c avg switch length: 2.00
61.46/61.53 c switching time : 0.00
61.46/61.53 c Solution :
61.46/61.53 c Solutions found : 0 (0 improvements)
61.46/61.53 c Primal Bound : infeasible
61.46/61.53 c Dual Bound : -
61.46/61.53 c Gap : 0.00 %
61.46/61.53 c Root Dual Bound : -
61.46/61.53 c Root Iterations : 28781
61.65/61.70 c Time complete: 61.66.