0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2704705-1278580361.opb>
1.49/1.54 c original problem has 31460 variables (31460 bin, 0 int, 0 impl, 0 cont) and 104814 constraints
1.49/1.54 c problem read
1.49/1.54 c No objective function, only one solution is needed.
1.49/1.54 c presolving settings loaded
1.99/2.08 c presolving:
7.19/7.25 c (round 1) 5841 del vars, 16898 del conss, 4345 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 6052486 impls, 0 clqs
9.79/9.87 c (round 2) 11784 del vars, 40031 del conss, 9834 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 6087889 impls, 0 clqs
10.48/10.54 c (round 3) 14052 del vars, 50435 del conss, 11122 chg bounds, 25 chg sides, 21 chg coeffs, 0 upgd conss, 6106749 impls, 0 clqs
10.78/10.86 c (round 4) 14916 del vars, 54159 del conss, 11713 chg bounds, 29 chg sides, 44 chg coeffs, 0 upgd conss, 6117891 impls, 0 clqs
11.08/11.13 c (round 5) 15696 del vars, 57090 del conss, 12175 chg bounds, 34 chg sides, 60 chg coeffs, 0 upgd conss, 6127793 impls, 0 clqs
11.28/11.34 c (round 6) 16286 del vars, 59356 del conss, 12532 chg bounds, 34 chg sides, 60 chg coeffs, 0 upgd conss, 6134255 impls, 0 clqs
11.39/11.45 c (round 7) 16590 del vars, 60574 del conss, 12677 chg bounds, 34 chg sides, 60 chg coeffs, 0 upgd conss, 6137976 impls, 0 clqs
11.48/11.53 c (round 8) 16724 del vars, 61149 del conss, 12738 chg bounds, 34 chg sides, 60 chg coeffs, 0 upgd conss, 6139587 impls, 0 clqs
11.48/11.58 c (round 9) 16775 del vars, 61406 del conss, 12757 chg bounds, 34 chg sides, 60 chg coeffs, 0 upgd conss, 6140386 impls, 0 clqs
11.58/11.63 c (round 10) 16796 del vars, 61503 del conss, 12766 chg bounds, 34 chg sides, 60 chg coeffs, 0 upgd conss, 6140618 impls, 0 clqs
11.58/11.66 c (round 11) 16806 del vars, 61543 del conss, 12769 chg bounds, 34 chg sides, 60 chg coeffs, 0 upgd conss, 6140746 impls, 0 clqs
11.68/11.70 c (round 12) 16808 del vars, 61554 del conss, 12769 chg bounds, 34 chg sides, 60 chg coeffs, 0 upgd conss, 6140790 impls, 0 clqs
11.99/12.08 c (round 13) 16808 del vars, 61554 del conss, 12769 chg bounds, 34 chg sides, 60 chg coeffs, 43260 upgd conss, 6140790 impls, 0 clqs
12.59/12.66 c (round 14) 16808 del vars, 61554 del conss, 12769 chg bounds, 47 chg sides, 180 chg coeffs, 43260 upgd conss, 6140790 impls, 0 clqs
12.69/12.77 c presolving (15 rounds):
12.69/12.77 c 16808 deleted vars, 61554 deleted constraints, 12769 tightened bounds, 0 added holes, 48 changed sides, 205 changed coefficients
12.69/12.77 c 6140790 implications, 1 cliques
12.69/12.77 c presolved problem has 14652 variables (14652 bin, 0 int, 0 impl, 0 cont) and 43260 constraints
12.69/12.77 c 482 constraints of type <knapsack>
12.69/12.77 c 35751 constraints of type <setppc>
12.69/12.77 c 7027 constraints of type <logicor>
12.69/12.77 c transformed objective value is always integral (scale: 1)
12.69/12.77 c Presolving Time: 10.87
12.69/12.77 c - non default parameters ----------------------------------------------------------------------
12.69/12.77 c # SCIP version 1.2.1.3
12.69/12.77 c
12.69/12.77 c # frequency for displaying node information lines
12.69/12.77 c # [type: int, range: [-1,2147483647], default: 100]
12.69/12.77 c display/freq = 10000
12.69/12.77 c
12.69/12.77 c # maximal time in seconds to run
12.69/12.77 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
12.69/12.77 c limits/time = 1788.46
12.69/12.77 c
12.69/12.77 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
12.69/12.77 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
12.69/12.77 c limits/memory = 1620
12.69/12.77 c
12.69/12.77 c # solving stops, if the given number of solutions were found (-1: no limit)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: -1]
12.69/12.77 c limits/solutions = 1
12.69/12.77 c
12.69/12.77 c # maximal number of separation rounds per node (-1: unlimited)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: 5]
12.69/12.77 c separating/maxrounds = 1
12.69/12.77 c
12.69/12.77 c # maximal number of separation rounds in the root node (-1: unlimited)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: -1]
12.69/12.77 c separating/maxroundsroot = 5
12.69/12.77 c
12.69/12.77 c # default clock type (1: CPU user seconds, 2: wall clock time)
12.69/12.77 c # [type: int, range: [1,2], default: 1]
12.69/12.77 c timing/clocktype = 2
12.69/12.77 c
12.69/12.77 c # should presolving try to simplify inequalities
12.69/12.77 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
12.69/12.77 c constraints/linear/simplifyinequalities = TRUE
12.69/12.77 c
12.69/12.77 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
12.69/12.77 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
12.69/12.77 c constraints/indicator/addCouplingCons = TRUE
12.69/12.77 c
12.69/12.77 c # should disaggregation of knapsack constraints be allowed in preprocessing?
12.69/12.77 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
12.69/12.77 c constraints/knapsack/disaggregation = FALSE
12.69/12.77 c
12.69/12.77 c # should presolving try to simplify knapsacks
12.69/12.77 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
12.69/12.77 c constraints/knapsack/simplifyinequalities = TRUE
12.69/12.77 c
12.69/12.77 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: -1]
12.69/12.77 c presolving/probing/maxrounds = 0
12.69/12.77 c
12.69/12.77 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: 10]
12.69/12.77 c heuristics/coefdiving/freq = -1
12.69/12.77 c
12.69/12.77 c # maximal fraction of diving LP iterations compared to node LP iterations
12.69/12.77 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
12.69/12.77 c heuristics/coefdiving/maxlpiterquot = 0.075
12.69/12.77 c
12.69/12.77 c # additional number of allowed LP iterations
12.69/12.77 c # [type: int, range: [0,2147483647], default: 1000]
12.69/12.77 c heuristics/coefdiving/maxlpiterofs = 1500
12.69/12.77 c
12.69/12.77 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: 30]
12.69/12.77 c heuristics/crossover/freq = -1
12.69/12.77 c
12.69/12.77 c # number of nodes added to the contingent of the total nodes
12.69/12.77 c # [type: longint, range: [0,9223372036854775807], default: 500]
12.69/12.77 c heuristics/crossover/nodesofs = 750
12.69/12.77 c
12.69/12.77 c # number of nodes without incumbent change that heuristic should wait
12.69/12.77 c # [type: longint, range: [0,9223372036854775807], default: 200]
12.69/12.77 c heuristics/crossover/nwaitingnodes = 100
12.69/12.77 c
12.69/12.77 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
12.69/12.77 c # [type: real, range: [0,1], default: 0.1]
12.69/12.77 c heuristics/crossover/nodesquot = 0.15
12.69/12.77 c
12.69/12.77 c # minimum percentage of integer variables that have to be fixed
12.69/12.77 c # [type: real, range: [0,1], default: 0.666]
12.69/12.77 c heuristics/crossover/minfixingrate = 0.5
12.69/12.77 c
12.69/12.77 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: 20]
12.69/12.77 c heuristics/feaspump/freq = -1
12.69/12.77 c
12.69/12.77 c # additional number of allowed LP iterations
12.69/12.77 c # [type: int, range: [0,2147483647], default: 1000]
12.69/12.77 c heuristics/feaspump/maxlpiterofs = 2000
12.69/12.77 c
12.69/12.77 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: 10]
12.69/12.77 c heuristics/fracdiving/freq = -1
12.69/12.77 c
12.69/12.77 c # maximal fraction of diving LP iterations compared to node LP iterations
12.69/12.77 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
12.69/12.77 c heuristics/fracdiving/maxlpiterquot = 0.075
12.69/12.77 c
12.69/12.77 c # additional number of allowed LP iterations
12.69/12.77 c # [type: int, range: [0,2147483647], default: 1000]
12.69/12.77 c heuristics/fracdiving/maxlpiterofs = 1500
12.69/12.77 c
12.69/12.77 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: 10]
12.69/12.77 c heuristics/guideddiving/freq = -1
12.69/12.77 c
12.69/12.77 c # maximal fraction of diving LP iterations compared to node LP iterations
12.69/12.77 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
12.69/12.77 c heuristics/guideddiving/maxlpiterquot = 0.075
12.69/12.77 c
12.69/12.77 c # additional number of allowed LP iterations
12.69/12.77 c # [type: int, range: [0,2147483647], default: 1000]
12.69/12.77 c heuristics/guideddiving/maxlpiterofs = 1500
12.69/12.77 c
12.69/12.77 c # maximal fraction of diving LP iterations compared to node LP iterations
12.69/12.77 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
12.69/12.77 c heuristics/intdiving/maxlpiterquot = 0.075
12.69/12.77 c
12.69/12.77 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: 10]
12.69/12.77 c heuristics/intshifting/freq = -1
12.69/12.77 c
12.69/12.77 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: 10]
12.69/12.77 c heuristics/linesearchdiving/freq = -1
12.69/12.77 c
12.69/12.77 c # maximal fraction of diving LP iterations compared to node LP iterations
12.69/12.77 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
12.69/12.77 c heuristics/linesearchdiving/maxlpiterquot = 0.075
12.69/12.77 c
12.69/12.77 c # additional number of allowed LP iterations
12.69/12.77 c # [type: int, range: [0,2147483647], default: 1000]
12.69/12.77 c heuristics/linesearchdiving/maxlpiterofs = 1500
12.69/12.77 c
12.69/12.77 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: 1]
12.69/12.77 c heuristics/nlp/freq = -1
12.69/12.77 c
12.69/12.77 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: 20]
12.69/12.77 c heuristics/objpscostdiving/freq = -1
12.69/12.77 c
12.69/12.77 c # maximal fraction of diving LP iterations compared to total iteration number
12.69/12.77 c # [type: real, range: [0,1], default: 0.01]
12.69/12.77 c heuristics/objpscostdiving/maxlpiterquot = 0.015
12.69/12.77 c
12.69/12.77 c # additional number of allowed LP iterations
12.69/12.77 c # [type: int, range: [0,2147483647], default: 1000]
12.69/12.77 c heuristics/objpscostdiving/maxlpiterofs = 1500
12.69/12.77 c
12.69/12.77 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: 1]
12.69/12.77 c heuristics/oneopt/freq = -1
12.69/12.77 c
12.69/12.77 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: 10]
12.69/12.77 c heuristics/pscostdiving/freq = -1
12.69/12.77 c
12.69/12.77 c # maximal fraction of diving LP iterations compared to node LP iterations
12.69/12.77 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
12.69/12.77 c heuristics/pscostdiving/maxlpiterquot = 0.075
12.69/12.77 c
12.69/12.77 c # additional number of allowed LP iterations
12.69/12.77 c # [type: int, range: [0,2147483647], default: 1000]
12.69/12.77 c heuristics/pscostdiving/maxlpiterofs = 1500
12.69/12.77 c
12.69/12.77 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: 0]
12.69/12.77 c heuristics/rens/freq = -1
12.69/12.77 c
12.69/12.77 c # minimum percentage of integer variables that have to be fixable
12.69/12.77 c # [type: real, range: [0,1], default: 0.5]
12.69/12.77 c heuristics/rens/minfixingrate = 0.3
12.69/12.77 c
12.69/12.77 c # number of nodes added to the contingent of the total nodes
12.69/12.77 c # [type: longint, range: [0,9223372036854775807], default: 500]
12.69/12.77 c heuristics/rens/nodesofs = 2000
12.69/12.77 c
12.69/12.77 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: 20]
12.69/12.77 c heuristics/rootsoldiving/freq = -1
12.69/12.77 c
12.69/12.77 c # maximal fraction of diving LP iterations compared to node LP iterations
12.69/12.77 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
12.69/12.77 c heuristics/rootsoldiving/maxlpiterquot = 0.015
12.69/12.77 c
12.69/12.77 c # additional number of allowed LP iterations
12.69/12.77 c # [type: int, range: [0,2147483647], default: 1000]
12.69/12.77 c heuristics/rootsoldiving/maxlpiterofs = 1500
12.69/12.77 c
12.69/12.77 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: 1]
12.69/12.77 c heuristics/rounding/freq = -1
12.69/12.77 c
12.69/12.77 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: 10]
12.69/12.77 c heuristics/shifting/freq = -1
12.69/12.77 c
12.69/12.77 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: 1]
12.69/12.77 c heuristics/simplerounding/freq = -1
12.69/12.77 c
12.69/12.77 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: 0]
12.69/12.77 c heuristics/trivial/freq = -1
12.69/12.77 c
12.69/12.77 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: 1]
12.69/12.77 c heuristics/trysol/freq = -1
12.69/12.77 c
12.69/12.77 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: 10]
12.69/12.77 c heuristics/veclendiving/freq = -1
12.69/12.77 c
12.69/12.77 c # maximal fraction of diving LP iterations compared to node LP iterations
12.69/12.77 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
12.69/12.77 c heuristics/veclendiving/maxlpiterquot = 0.075
12.69/12.77 c
12.69/12.77 c # additional number of allowed LP iterations
12.69/12.77 c # [type: int, range: [0,2147483647], default: 1000]
12.69/12.77 c heuristics/veclendiving/maxlpiterofs = 1500
12.69/12.77 c
12.69/12.77 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: 1]
12.69/12.77 c heuristics/zirounding/freq = -1
12.69/12.77 c
12.69/12.77 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: 0]
12.69/12.77 c separating/cmir/freq = -1
12.69/12.77 c
12.69/12.77 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: 0]
12.69/12.77 c separating/flowcover/freq = -1
12.69/12.77 c
12.69/12.77 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
12.69/12.77 c # [type: int, range: [-1,2147483647], default: -1]
12.69/12.77 c separating/rapidlearning/freq = 0
12.69/12.77 c
12.69/12.77 c -----------------------------------------------------------------------------------------------
12.69/12.77 c start solving
12.69/12.78 c
686.58/686.88 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
686.58/686.88 c 685s| 1 | 0 | 49279 | - | 210M| 0 | - | 14k| 43k| 14k| 43k| 0 | 0 | 0 | -- | -- | 0.00%
686.58/686.88 c 685s| 1 | 0 | 49279 | - | 210M| 0 | - | 14k| 43k| 14k| 43k| 0 | 0 | 0 | -- | -- | 0.00%
686.58/686.88 c
686.58/686.88 c SCIP Status : problem is solved [infeasible]
686.58/686.88 c Solving Time (sec) : 685.34
686.58/686.88 c Solving Nodes : 1
686.58/686.88 c Primal Bound : +1.00000000000000e+20 (0 solutions)
686.58/686.88 c Dual Bound : +1.00000000000000e+20
686.58/686.88 c Gap : 0.00 %
686.58/686.88 s UNSATISFIABLE
686.58/686.88 c SCIP Status : problem is solved [infeasible]
686.58/686.88 c Solving Time : 685.34
686.58/686.88 c Original Problem :
686.58/686.88 c Problem name : HOME/instance-2704705-1278580361.opb
686.58/686.88 c Variables : 31460 (31460 binary, 0 integer, 0 implicit integer, 0 continuous)
686.58/686.88 c Constraints : 104814 initial, 104814 maximal
686.58/686.88 c Presolved Problem :
686.58/686.88 c Problem name : t_HOME/instance-2704705-1278580361.opb
686.58/686.88 c Variables : 14652 (14652 binary, 0 integer, 0 implicit integer, 0 continuous)
686.58/686.88 c Constraints : 43260 initial, 43260 maximal
686.58/686.88 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
686.58/686.88 c trivial : 0.05 692 0 0 0 0 0 0 0
686.58/686.88 c dualfix : 0.09 111 0 0 0 0 0 0 0
686.58/686.88 c boundshift : 0.00 0 0 0 0 0 0 0 0
686.58/686.88 c inttobinary : 0.00 0 0 0 0 0 0 0 0
686.58/686.88 c implics : 0.25 0 0 0 0 0 0 0 0
686.58/686.88 c probing : 0.00 0 0 0 0 0 0 0 0
686.58/686.88 c knapsack : 0.45 0 0 0 0 0 0 14 145
686.58/686.88 c setppc : 0.16 0 0 0 0 0 0 0 0
686.58/686.88 c linear : 9.46 12080 3925 0 12769 0 61554 34 60
686.58/686.88 c logicor : 0.07 0 0 0 0 0 0 0 0
686.58/686.88 c root node : - 0 - - 0 - - - -
686.58/686.88 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
686.58/686.88 c integral : 0 0 0 0 0 0 0 0 0 0
686.58/686.88 c knapsack : 482 0 1 0 0 0 0 0 0 0
686.58/686.88 c setppc : 35751 0 1 0 0 0 0 0 0 0
686.58/686.88 c logicor : 7027 0 1 0 0 0 0 0 0 0
686.58/686.88 c countsols : 0 0 0 0 0 0 0 0 0 0
686.58/686.88 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
686.58/686.88 c integral : 0.00 0.00 0.00 0.00 0.00
686.58/686.88 c knapsack : 0.00 0.00 0.00 0.00 0.00
686.58/686.88 c setppc : 0.00 0.00 0.00 0.00 0.00
686.58/686.88 c logicor : 0.01 0.00 0.01 0.00 0.00
686.58/686.88 c countsols : 0.00 0.00 0.00 0.00 0.00
686.58/686.88 c Propagators : Time Calls Cutoffs DomReds
686.58/686.88 c vbounds : 0.00 1 0 0
686.58/686.88 c rootredcost : 0.00 0 0 0
686.58/686.88 c pseudoobj : 0.00 0 0 0
686.58/686.88 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
686.58/686.88 c propagation : 0.00 0 0 0 0.0 0 0.0 -
686.58/686.88 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
686.58/686.88 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
686.58/686.88 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
686.58/686.88 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
686.58/686.88 c applied globally : - - - 0 0.0 - - -
686.58/686.88 c applied locally : - - - 0 0.0 - - -
686.58/686.88 c Separators : Time Calls Cutoffs DomReds Cuts Conss
686.58/686.88 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
686.58/686.88 c redcost : 0.00 0 0 0 0 0
686.58/686.88 c impliedbounds : 0.00 0 0 0 0 0
686.58/686.88 c intobj : 0.00 0 0 0 0 0
686.58/686.88 c cgmip : 0.00 0 0 0 0 0
686.58/686.88 c gomory : 0.00 0 0 0 0 0
686.58/686.88 c strongcg : 0.00 0 0 0 0 0
686.58/686.88 c cmir : 0.00 0 0 0 0 0
686.58/686.88 c flowcover : 0.00 0 0 0 0 0
686.58/686.88 c clique : 0.00 0 0 0 0 0
686.58/686.88 c zerohalf : 0.00 0 0 0 0 0
686.58/686.88 c mcf : 0.00 0 0 0 0 0
686.58/686.88 c rapidlearning : 0.00 0 0 0 0 0
686.58/686.88 c Pricers : Time Calls Vars
686.58/686.88 c problem variables: 0.00 0 0
686.58/686.88 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
686.58/686.88 c pscost : 0.00 0 0 0 0 0 0
686.58/686.88 c inference : 0.00 0 0 0 0 0 0
686.58/686.88 c mostinf : 0.00 0 0 0 0 0 0
686.58/686.88 c leastinf : 0.00 0 0 0 0 0 0
686.58/686.88 c fullstrong : 0.00 0 0 0 0 0 0
686.58/686.88 c allfullstrong : 0.00 0 0 0 0 0 0
686.58/686.88 c random : 0.00 0 0 0 0 0 0
686.58/686.88 c relpscost : 0.00 0 0 0 0 0 0
686.58/686.88 c Primal Heuristics : Time Calls Found
686.58/686.88 c LP solutions : 0.00 - 0
686.58/686.88 c pseudo solutions : 0.00 - 0
686.58/686.88 c trivial : 0.06 1 0
686.58/686.88 c simplerounding : 0.00 0 0
686.58/686.88 c zirounding : 0.00 0 0
686.58/686.88 c rounding : 0.00 0 0
686.58/686.88 c shifting : 0.00 0 0
686.58/686.88 c intshifting : 0.00 0 0
686.58/686.88 c oneopt : 0.00 0 0
686.58/686.88 c twoopt : 0.00 0 0
686.58/686.88 c fixandinfer : 0.00 0 0
686.58/686.88 c feaspump : 0.00 0 0
686.58/686.88 c coefdiving : 0.00 0 0
686.58/686.88 c pscostdiving : 0.00 0 0
686.58/686.88 c fracdiving : 0.00 0 0
686.58/686.88 c veclendiving : 0.00 0 0
686.58/686.88 c intdiving : 0.00 0 0
686.58/686.88 c actconsdiving : 0.00 0 0
686.58/686.88 c objpscostdiving : 0.00 0 0
686.58/686.88 c rootsoldiving : 0.00 0 0
686.58/686.88 c linesearchdiving : 0.00 0 0
686.58/686.88 c guideddiving : 0.00 0 0
686.58/686.88 c octane : 0.00 0 0
686.58/686.88 c rens : 0.00 0 0
686.58/686.88 c rins : 0.00 0 0
686.58/686.88 c localbranching : 0.00 0 0
686.58/686.88 c mutation : 0.00 0 0
686.58/686.88 c crossover : 0.00 0 0
686.58/686.88 c dins : 0.00 0 0
686.58/686.88 c undercover : 0.00 0 0
686.58/686.88 c nlp : 0.00 0 0
686.58/686.89 c trysol : 0.00 0 0
686.58/686.89 c LP : Time Calls Iterations Iter/call Iter/sec
686.58/686.89 c primal LP : 0.00 0 0 0.00 -
686.58/686.89 c dual LP : 673.85 1 49279 49279.00 73.13
686.58/686.89 c lex dual LP : 0.00 0 0 0.00 -
686.58/686.89 c barrier LP : 0.00 0 0 0.00 -
686.58/686.89 c diving/probing LP: 0.00 0 0 0.00 -
686.58/686.89 c strong branching : 0.00 0 0 0.00 -
686.58/686.89 c (at root node) : - 0 0 0.00 -
686.58/686.89 c conflict analysis: 0.00 0 0 0.00 -
686.58/686.89 c B&B Tree :
686.58/686.89 c number of runs : 1
686.58/686.89 c nodes : 1
686.58/686.89 c nodes (total) : 1
686.58/686.89 c nodes left : 0
686.58/686.89 c max depth : 0
686.58/686.89 c max depth (total): 0
686.58/686.89 c backtracks : 0 (0.0%)
686.58/686.89 c delayed cutoffs : 0
686.58/686.89 c repropagations : 0 (0 domain reductions, 0 cutoffs)
686.58/686.89 c avg switch length: 2.00
686.58/686.89 c switching time : 0.00
686.58/686.89 c Solution :
686.58/686.89 c Solutions found : 0 (0 improvements)
686.58/686.89 c Primal Bound : infeasible
686.58/686.89 c Dual Bound : -
686.58/686.89 c Gap : 0.00 %
686.58/686.89 c Root Dual Bound : -
686.58/686.89 c Root Iterations : 49279
687.08/687.32 c Time complete: 687.1.