0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 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-2684536-1278432542.opb>
0.19/0.25 c original problem has 3968 variables (3968 bin, 0 int, 0 impl, 0 cont) and 13430 constraints
0.19/0.25 c problem read
0.19/0.25 c No objective function, only one solution is needed.
0.19/0.25 c presolving settings loaded
0.29/0.32 c presolving:
0.79/0.80 c (round 1) 1414 del vars, 3678 del conss, 1043 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 598348 impls, 0 clqs
0.89/0.98 c (round 2) 2752 del vars, 8895 del conss, 2237 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 606296 impls, 0 clqs
1.00/1.01 c (round 3) 3070 del vars, 10632 del conss, 2401 chg bounds, 56 chg sides, 49 chg coeffs, 0 upgd conss, 608748 impls, 0 clqs
1.00/1.03 c (round 4) 3276 del vars, 11219 del conss, 2524 chg bounds, 75 chg sides, 68 chg coeffs, 0 upgd conss, 611604 impls, 0 clqs
1.00/1.05 c (round 5) 3402 del vars, 11758 del conss, 2607 chg bounds, 79 chg sides, 72 chg coeffs, 0 upgd conss, 613169 impls, 0 clqs
1.00/1.05 c (round 6) 3478 del vars, 11993 del conss, 2664 chg bounds, 98 chg sides, 90 chg coeffs, 0 upgd conss, 613593 impls, 0 clqs
1.00/1.06 c (round 7) 3499 del vars, 12084 del conss, 2669 chg bounds, 110 chg sides, 102 chg coeffs, 0 upgd conss, 613781 impls, 0 clqs
1.00/1.06 c (round 8) 3499 del vars, 12110 del conss, 2669 chg bounds, 110 chg sides, 102 chg coeffs, 0 upgd conss, 613781 impls, 0 clqs
1.10/1.11 c (round 9) 3499 del vars, 12113 del conss, 2669 chg bounds, 110 chg sides, 102 chg coeffs, 1320 upgd conss, 613781 impls, 0 clqs
1.10/1.14 c (round 10) 3499 del vars, 12113 del conss, 2669 chg bounds, 142 chg sides, 306 chg coeffs, 1320 upgd conss, 614581 impls, 66 clqs
1.10/1.17 c (round 11) 3499 del vars, 12116 del conss, 2669 chg bounds, 161 chg sides, 460 chg coeffs, 1320 upgd conss, 614653 impls, 85 clqs
1.10/1.18 c (round 12) 3499 del vars, 12116 del conss, 2669 chg bounds, 164 chg sides, 517 chg coeffs, 1320 upgd conss, 614685 impls, 101 clqs
1.10/1.19 c (round 13) 3499 del vars, 12116 del conss, 2669 chg bounds, 166 chg sides, 548 chg coeffs, 1320 upgd conss, 614729 impls, 110 clqs
1.10/1.19 c (round 14) 3499 del vars, 12116 del conss, 2669 chg bounds, 166 chg sides, 556 chg coeffs, 1320 upgd conss, 614729 impls, 115 clqs
1.19/1.20 c (round 15) 3499 del vars, 12116 del conss, 2669 chg bounds, 166 chg sides, 557 chg coeffs, 1320 upgd conss, 614729 impls, 118 clqs
1.19/1.20 c presolving (16 rounds):
1.19/1.20 c 3499 deleted vars, 12116 deleted constraints, 2669 tightened bounds, 0 added holes, 166 changed sides, 557 changed coefficients
1.19/1.20 c 614729 implications, 118 cliques
1.19/1.20 c presolved problem has 469 variables (469 bin, 0 int, 0 impl, 0 cont) and 1314 constraints
1.19/1.20 c 191 constraints of type <knapsack>
1.19/1.20 c 1123 constraints of type <logicor>
1.19/1.20 c transformed objective value is always integral (scale: 1)
1.19/1.20 c Presolving Time: 0.81
1.19/1.20 c - non default parameters ----------------------------------------------------------------------
1.19/1.20 c # SCIP version 1.2.1.2
1.19/1.20 c
1.19/1.20 c # frequency for displaying node information lines
1.19/1.21 c # [type: int, range: [-1,2147483647], default: 100]
1.19/1.21 c display/freq = 10000
1.19/1.21 c
1.19/1.21 c # maximal time in seconds to run
1.19/1.21 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.19/1.21 c limits/time = 1799.75
1.19/1.21 c
1.19/1.21 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.19/1.21 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.19/1.21 c limits/memory = 1620
1.19/1.21 c
1.19/1.21 c # solving stops, if the given number of solutions were found (-1: no limit)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: -1]
1.19/1.21 c limits/solutions = 1
1.19/1.21 c
1.19/1.21 c # maximal number of separation rounds per node (-1: unlimited)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: 5]
1.19/1.21 c separating/maxrounds = 1
1.19/1.21 c
1.19/1.21 c # maximal number of separation rounds in the root node (-1: unlimited)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: -1]
1.19/1.21 c separating/maxroundsroot = 5
1.19/1.21 c
1.19/1.21 c # should presolving try to simplify inequalities
1.19/1.21 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.19/1.21 c constraints/linear/simplifyinequalities = TRUE
1.19/1.21 c
1.19/1.21 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.19/1.21 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.19/1.21 c constraints/knapsack/disaggregation = FALSE
1.19/1.21 c
1.19/1.21 c # should presolving try to simplify knapsacks
1.19/1.21 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.19/1.21 c constraints/knapsack/simplifyinequalities = TRUE
1.19/1.21 c
1.19/1.21 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: -1]
1.19/1.21 c presolving/probing/maxrounds = 0
1.19/1.21 c
1.19/1.21 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: 10]
1.19/1.21 c heuristics/coefdiving/freq = -1
1.19/1.21 c
1.19/1.21 c # maximal fraction of diving LP iterations compared to node LP iterations
1.19/1.21 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.19/1.21 c heuristics/coefdiving/maxlpiterquot = 0.075
1.19/1.21 c
1.19/1.21 c # additional number of allowed LP iterations
1.19/1.21 c # [type: int, range: [0,2147483647], default: 1000]
1.19/1.21 c heuristics/coefdiving/maxlpiterofs = 1500
1.19/1.21 c
1.19/1.21 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: 30]
1.19/1.21 c heuristics/crossover/freq = -1
1.19/1.21 c
1.19/1.21 c # number of nodes added to the contingent of the total nodes
1.19/1.21 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.19/1.21 c heuristics/crossover/nodesofs = 750
1.19/1.21 c
1.19/1.21 c # number of nodes without incumbent change that heuristic should wait
1.19/1.21 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.19/1.21 c heuristics/crossover/nwaitingnodes = 100
1.19/1.21 c
1.19/1.21 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.19/1.21 c # [type: real, range: [0,1], default: 0.1]
1.19/1.21 c heuristics/crossover/nodesquot = 0.15
1.19/1.21 c
1.19/1.21 c # minimum percentage of integer variables that have to be fixed
1.19/1.21 c # [type: real, range: [0,1], default: 0.666]
1.19/1.21 c heuristics/crossover/minfixingrate = 0.5
1.19/1.21 c
1.19/1.21 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: 20]
1.19/1.21 c heuristics/feaspump/freq = -1
1.19/1.21 c
1.19/1.21 c # additional number of allowed LP iterations
1.19/1.21 c # [type: int, range: [0,2147483647], default: 1000]
1.19/1.21 c heuristics/feaspump/maxlpiterofs = 2000
1.19/1.21 c
1.19/1.21 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: 10]
1.19/1.21 c heuristics/fracdiving/freq = -1
1.19/1.21 c
1.19/1.21 c # maximal fraction of diving LP iterations compared to node LP iterations
1.19/1.21 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.19/1.21 c heuristics/fracdiving/maxlpiterquot = 0.075
1.19/1.21 c
1.19/1.21 c # additional number of allowed LP iterations
1.19/1.21 c # [type: int, range: [0,2147483647], default: 1000]
1.19/1.21 c heuristics/fracdiving/maxlpiterofs = 1500
1.19/1.21 c
1.19/1.21 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: 10]
1.19/1.21 c heuristics/guideddiving/freq = -1
1.19/1.21 c
1.19/1.21 c # maximal fraction of diving LP iterations compared to node LP iterations
1.19/1.21 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.19/1.21 c heuristics/guideddiving/maxlpiterquot = 0.075
1.19/1.21 c
1.19/1.21 c # additional number of allowed LP iterations
1.19/1.21 c # [type: int, range: [0,2147483647], default: 1000]
1.19/1.21 c heuristics/guideddiving/maxlpiterofs = 1500
1.19/1.21 c
1.19/1.21 c # maximal fraction of diving LP iterations compared to node LP iterations
1.19/1.21 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.19/1.21 c heuristics/intdiving/maxlpiterquot = 0.075
1.19/1.21 c
1.19/1.21 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: 10]
1.19/1.21 c heuristics/intshifting/freq = -1
1.19/1.21 c
1.19/1.21 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: 10]
1.19/1.21 c heuristics/linesearchdiving/freq = -1
1.19/1.21 c
1.19/1.21 c # maximal fraction of diving LP iterations compared to node LP iterations
1.19/1.21 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.19/1.21 c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.19/1.21 c
1.19/1.21 c # additional number of allowed LP iterations
1.19/1.21 c # [type: int, range: [0,2147483647], default: 1000]
1.19/1.21 c heuristics/linesearchdiving/maxlpiterofs = 1500
1.19/1.21 c
1.19/1.21 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: 1]
1.19/1.21 c heuristics/nlp/freq = -1
1.19/1.21 c
1.19/1.21 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: 20]
1.19/1.21 c heuristics/objpscostdiving/freq = -1
1.19/1.21 c
1.19/1.21 c # maximal fraction of diving LP iterations compared to total iteration number
1.19/1.21 c # [type: real, range: [0,1], default: 0.01]
1.19/1.21 c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.19/1.21 c
1.19/1.21 c # additional number of allowed LP iterations
1.19/1.21 c # [type: int, range: [0,2147483647], default: 1000]
1.19/1.21 c heuristics/objpscostdiving/maxlpiterofs = 1500
1.19/1.21 c
1.19/1.21 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: 1]
1.19/1.21 c heuristics/oneopt/freq = -1
1.19/1.21 c
1.19/1.21 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: 10]
1.19/1.21 c heuristics/pscostdiving/freq = -1
1.19/1.21 c
1.19/1.21 c # maximal fraction of diving LP iterations compared to node LP iterations
1.19/1.21 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.19/1.21 c heuristics/pscostdiving/maxlpiterquot = 0.075
1.19/1.21 c
1.19/1.21 c # additional number of allowed LP iterations
1.19/1.21 c # [type: int, range: [0,2147483647], default: 1000]
1.19/1.21 c heuristics/pscostdiving/maxlpiterofs = 1500
1.19/1.21 c
1.19/1.21 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: 0]
1.19/1.21 c heuristics/rens/freq = -1
1.19/1.21 c
1.19/1.21 c # minimum percentage of integer variables that have to be fixable
1.19/1.21 c # [type: real, range: [0,1], default: 0.5]
1.19/1.21 c heuristics/rens/minfixingrate = 0.3
1.19/1.21 c
1.19/1.21 c # number of nodes added to the contingent of the total nodes
1.19/1.21 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.19/1.21 c heuristics/rens/nodesofs = 2000
1.19/1.21 c
1.19/1.21 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: 20]
1.19/1.21 c heuristics/rootsoldiving/freq = -1
1.19/1.21 c
1.19/1.21 c # maximal fraction of diving LP iterations compared to node LP iterations
1.19/1.21 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.19/1.21 c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.19/1.21 c
1.19/1.21 c # additional number of allowed LP iterations
1.19/1.21 c # [type: int, range: [0,2147483647], default: 1000]
1.19/1.21 c heuristics/rootsoldiving/maxlpiterofs = 1500
1.19/1.21 c
1.19/1.21 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: 1]
1.19/1.21 c heuristics/rounding/freq = -1
1.19/1.21 c
1.19/1.21 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: 10]
1.19/1.21 c heuristics/shifting/freq = -1
1.19/1.21 c
1.19/1.21 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: 1]
1.19/1.21 c heuristics/simplerounding/freq = -1
1.19/1.21 c
1.19/1.21 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: 0]
1.19/1.21 c heuristics/trivial/freq = -1
1.19/1.21 c
1.19/1.21 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: 1]
1.19/1.21 c heuristics/trysol/freq = -1
1.19/1.21 c
1.19/1.21 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: 10]
1.19/1.21 c heuristics/veclendiving/freq = -1
1.19/1.21 c
1.19/1.21 c # maximal fraction of diving LP iterations compared to node LP iterations
1.19/1.21 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.19/1.21 c heuristics/veclendiving/maxlpiterquot = 0.075
1.19/1.21 c
1.19/1.21 c # additional number of allowed LP iterations
1.19/1.21 c # [type: int, range: [0,2147483647], default: 1000]
1.19/1.21 c heuristics/veclendiving/maxlpiterofs = 1500
1.19/1.21 c
1.19/1.21 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: 1]
1.19/1.21 c heuristics/zirounding/freq = -1
1.19/1.21 c
1.19/1.21 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: 0]
1.19/1.21 c separating/cmir/freq = -1
1.19/1.21 c
1.19/1.21 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: 0]
1.19/1.21 c separating/flowcover/freq = -1
1.19/1.21 c
1.19/1.21 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.19/1.21 c # [type: int, range: [-1,2147483647], default: -1]
1.19/1.21 c separating/rapidlearning/freq = 0
1.19/1.21 c
1.19/1.21 c -----------------------------------------------------------------------------------------------
1.19/1.21 c start solving
1.19/1.21 c
1.29/1.34 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.29/1.34 c 1.0s| 1 | 0 | 864 | - | 15M| 0 | 280 | 469 |1314 | 469 |1314 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1.89/1.90 c 1.4s| 1 | 0 | 1094 | - | 14M| 0 | - | 469 |1314 | 469 |1314 | 0 | 0 | 0 | -- | -- | 0.00%
1.89/1.90 c 1.4s| 1 | 0 | 1094 | - | 14M| 0 | - | 469 |1314 | 469 |1314 | 0 | 0 | 0 | -- | -- | 0.00%
1.89/1.90 c
1.89/1.90 c SCIP Status : problem is solved [infeasible]
1.89/1.90 c Solving Time (sec) : 1.45
1.89/1.90 c Solving Nodes : 1
1.89/1.90 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1.89/1.90 c Dual Bound : +1.00000000000000e+20
1.89/1.90 c Gap : 0.00 %
1.89/1.90 s UNSATISFIABLE
1.89/1.90 c SCIP Status : problem is solved [infeasible]
1.89/1.90 c Solving Time : 1.45
1.89/1.90 c Original Problem :
1.89/1.90 c Problem name : HOME/instance-2684536-1278432542.opb
1.89/1.90 c Variables : 3968 (3968 binary, 0 integer, 0 implicit integer, 0 continuous)
1.89/1.90 c Constraints : 13430 initial, 13430 maximal
1.89/1.90 c Presolved Problem :
1.89/1.90 c Problem name : t_HOME/instance-2684536-1278432542.opb
1.89/1.90 c Variables : 469 (469 binary, 0 integer, 0 implicit integer, 0 continuous)
1.89/1.90 c Constraints : 1314 initial, 1314 maximal
1.89/1.90 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.89/1.90 c trivial : 0.00 124 0 0 0 0 0 0 0
1.89/1.90 c dualfix : 0.01 28 0 0 0 0 0 0 0
1.89/1.90 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.89/1.90 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.89/1.90 c implics : 0.01 0 23 0 0 0 0 0 0
1.89/1.90 c probing : 0.00 0 0 0 0 0 0 0 0
1.89/1.90 c knapsack : 0.02 0 0 0 0 0 1 56 455
1.89/1.90 c linear : 0.66 2545 779 0 2669 0 12110 110 102
1.89/1.90 c logicor : 0.05 0 0 0 0 0 5 0 0
1.89/1.90 c root node : - 252 - - 252 - - - -
1.89/1.90 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.89/1.90 c integral : 0 0 0 0 0 0 0 0 0 0
1.89/1.90 c knapsack : 191 1 1 0 0 0 0 133 0 0
1.89/1.90 c logicor : 1123 1 1 0 0 0 0 0 0 0
1.89/1.90 c countsols : 0 0 0 0 0 0 0 0 0 0
1.89/1.90 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.89/1.90 c integral : 0.00 0.00 0.00 0.00 0.00
1.89/1.90 c knapsack : 0.01 0.01 0.00 0.00 0.00
1.89/1.90 c logicor : 0.00 0.00 0.00 0.00 0.00
1.89/1.90 c countsols : 0.00 0.00 0.00 0.00 0.00
1.89/1.90 c Propagators : Time Calls Cutoffs DomReds
1.89/1.90 c vbounds : 0.00 1 0 0
1.89/1.90 c rootredcost : 0.00 0 0 0
1.89/1.90 c pseudoobj : 0.00 0 0 0
1.89/1.90 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.89/1.90 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.89/1.90 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.89/1.90 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.89/1.90 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.89/1.90 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.89/1.90 c applied globally : - - - 0 0.0 - - -
1.89/1.90 c applied locally : - - - 0 0.0 - - -
1.89/1.90 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.89/1.90 c cut pool : 0.00 0 - - 0 - (maximal pool size: 256)
1.89/1.90 c redcost : 0.00 1 0 0 0 0
1.89/1.90 c impliedbounds : 0.00 1 0 0 28 0
1.89/1.90 c intobj : 0.00 0 0 0 0 0
1.89/1.90 c cgmip : 0.00 0 0 0 0 0
1.89/1.90 c gomory : 0.12 1 0 0 0 0
1.89/1.90 c strongcg : 0.11 1 0 0 500 0
1.89/1.90 c cmir : 0.00 0 0 0 0 0
1.89/1.90 c flowcover : 0.00 0 0 0 0 0
1.89/1.90 c clique : 0.01 1 0 0 7 0
1.89/1.90 c zerohalf : 0.00 0 0 0 0 0
1.89/1.90 c mcf : 0.01 1 0 0 0 0
1.89/1.90 c rapidlearning : 0.14 1 0 252 0 0
1.89/1.90 c Pricers : Time Calls Vars
1.89/1.90 c problem variables: 0.00 0 0
1.89/1.90 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.89/1.90 c pscost : 0.00 0 0 0 0 0 0
1.89/1.90 c inference : 0.00 0 0 0 0 0 0
1.89/1.90 c mostinf : 0.00 0 0 0 0 0 0
1.89/1.90 c leastinf : 0.00 0 0 0 0 0 0
1.89/1.90 c fullstrong : 0.00 0 0 0 0 0 0
1.89/1.90 c allfullstrong : 0.00 0 0 0 0 0 0
1.89/1.90 c random : 0.00 0 0 0 0 0 0
1.89/1.90 c relpscost : 0.00 0 0 0 0 0 0
1.89/1.90 c Primal Heuristics : Time Calls Found
1.89/1.90 c LP solutions : 0.00 - 0
1.89/1.90 c pseudo solutions : 0.00 - 0
1.89/1.90 c trivial : 0.01 1 0
1.89/1.90 c simplerounding : 0.00 0 0
1.89/1.90 c zirounding : 0.00 0 0
1.89/1.90 c rounding : 0.00 0 0
1.89/1.90 c shifting : 0.00 0 0
1.89/1.90 c intshifting : 0.00 0 0
1.89/1.90 c oneopt : 0.00 0 0
1.89/1.90 c twoopt : 0.00 0 0
1.89/1.90 c fixandinfer : 0.00 0 0
1.89/1.90 c feaspump : 0.00 0 0
1.89/1.90 c coefdiving : 0.00 0 0
1.89/1.90 c pscostdiving : 0.00 0 0
1.89/1.90 c fracdiving : 0.00 0 0
1.89/1.90 c veclendiving : 0.00 0 0
1.89/1.90 c intdiving : 0.00 0 0
1.89/1.90 c actconsdiving : 0.00 0 0
1.89/1.90 c objpscostdiving : 0.00 0 0
1.89/1.90 c rootsoldiving : 0.00 0 0
1.89/1.90 c linesearchdiving : 0.00 0 0
1.89/1.90 c guideddiving : 0.00 0 0
1.89/1.90 c octane : 0.00 0 0
1.89/1.90 c rens : 0.00 0 0
1.89/1.90 c rins : 0.00 0 0
1.89/1.90 c localbranching : 0.00 0 0
1.89/1.90 c mutation : 0.00 0 0
1.89/1.90 c crossover : 0.00 0 0
1.89/1.90 c dins : 0.00 0 0
1.89/1.90 c undercover : 0.00 0 0
1.89/1.90 c nlp : 0.00 0 0
1.89/1.90 c trysol : 0.00 0 0
1.89/1.90 c LP : Time Calls Iterations Iter/call Iter/sec
1.89/1.90 c primal LP : 0.00 0 0 0.00 -
1.89/1.90 c dual LP : 0.21 2 1094 547.00 5209.52
1.89/1.90 c lex dual LP : 0.00 0 0 0.00 -
1.89/1.90 c barrier LP : 0.00 0 0 0.00 -
1.89/1.90 c diving/probing LP: 0.00 0 0 0.00 -
1.89/1.90 c strong branching : 0.00 0 0 0.00 -
1.89/1.90 c (at root node) : - 0 0 0.00 -
1.89/1.90 c conflict analysis: 0.00 0 0 0.00 -
1.89/1.90 c B&B Tree :
1.89/1.90 c number of runs : 1
1.89/1.90 c nodes : 1
1.89/1.90 c nodes (total) : 1
1.89/1.90 c nodes left : 0
1.89/1.90 c max depth : 0
1.89/1.90 c max depth (total): 0
1.89/1.90 c backtracks : 0 (0.0%)
1.89/1.90 c delayed cutoffs : 0
1.89/1.90 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.89/1.90 c avg switch length: 2.00
1.89/1.90 c switching time : 0.00
1.89/1.90 c Solution :
1.89/1.90 c Solutions found : 0 (0 improvements)
1.89/1.90 c Primal Bound : infeasible
1.89/1.90 c Dual Bound : -
1.89/1.90 c Gap : 0.00 %
1.89/1.90 c Root Dual Bound : -
1.89/1.90 c Root Iterations : 1094
1.89/1.93 c Time complete: 1.92.