0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [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-2663406-1276675105.opb>
0.00/0.02 c original problem has 1580 variables (1580 bin, 0 int, 0 impl, 0 cont) and 1632 constraints
0.00/0.02 c problem read
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c presolving settings loaded
0.00/0.02 c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.02/0.04 c presolving:
0.19/0.24 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 11940 impls, 100 clqs
0.39/0.42 c presolving (2 rounds):
0.39/0.42 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.39/0.42 c 11940 implications, 100 cliques
0.39/0.42 c presolved problem has 1580 variables (1580 bin, 0 int, 0 impl, 0 cont) and 1632 constraints
0.39/0.42 c 1 constraints of type <knapsack>
0.39/0.42 c 100 constraints of type <setppc>
0.39/0.42 c 1480 constraints of type <and>
0.39/0.42 c 1 constraints of type <linear>
0.39/0.42 c 50 constraints of type <logicor>
0.39/0.42 c transformed objective value is always integral (scale: 1)
0.39/0.42 c Presolving Time: 0.20
0.39/0.42 c - non default parameters ----------------------------------------------------------------------
0.39/0.42 c # SCIP version 1.2.1.2
0.39/0.42 c
0.39/0.42 c # frequency for displaying node information lines
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 100]
0.39/0.42 c display/freq = 10000
0.39/0.42 c
0.39/0.42 c # maximal time in seconds to run
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.42 c limits/time = 1799.98
0.39/0.42 c
0.39/0.42 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.42 c limits/memory = 1620
0.39/0.42 c
0.39/0.42 c # solving stops, if the given number of solutions were found (-1: no limit)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c limits/solutions = 1
0.39/0.42 c
0.39/0.42 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c lp/solvefreq = -1
0.39/0.42 c
0.39/0.42 c # maximal number of separation rounds per node (-1: unlimited)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 5]
0.39/0.42 c separating/maxrounds = 1
0.39/0.42 c
0.39/0.42 c # maximal number of separation rounds in the root node (-1: unlimited)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c separating/maxroundsroot = 5
0.39/0.42 c
0.39/0.42 c # should presolving try to simplify inequalities
0.39/0.42 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.42 c constraints/linear/simplifyinequalities = TRUE
0.39/0.42 c
0.39/0.42 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.39/0.42 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.39/0.42 c constraints/knapsack/disaggregation = FALSE
0.39/0.42 c
0.39/0.42 c # should presolving try to simplify knapsacks
0.39/0.42 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.42 c constraints/knapsack/simplifyinequalities = TRUE
0.39/0.42 c
0.39/0.42 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c presolving/probing/maxrounds = 0
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/coefdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/coefdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/coefdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 30]
0.39/0.42 c heuristics/crossover/freq = -1
0.39/0.42 c
0.39/0.42 c # number of nodes added to the contingent of the total nodes
0.39/0.42 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.42 c heuristics/crossover/nodesofs = 750
0.39/0.42 c
0.39/0.42 c # number of nodes without incumbent change that heuristic should wait
0.39/0.42 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.39/0.42 c heuristics/crossover/nwaitingnodes = 100
0.39/0.42 c
0.39/0.42 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.39/0.42 c # [type: real, range: [0,1], default: 0.1]
0.39/0.42 c heuristics/crossover/nodesquot = 0.15
0.39/0.42 c
0.39/0.42 c # minimum percentage of integer variables that have to be fixed
0.39/0.42 c # [type: real, range: [0,1], default: 0.666]
0.39/0.42 c heuristics/crossover/minfixingrate = 0.5
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.42 c heuristics/feaspump/freq = -1
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/feaspump/maxlpiterofs = 2000
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/fracdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/fracdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/fracdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/guideddiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/guideddiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/guideddiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/intdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/intshifting/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/linesearchdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/nlp/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.42 c heuristics/objpscostdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to total iteration number
0.39/0.42 c # [type: real, range: [0,1], default: 0.01]
0.39/0.42 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/oneopt/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/pscostdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/pscostdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c heuristics/rens/freq = -1
0.39/0.42 c
0.39/0.42 c # minimum percentage of integer variables that have to be fixable
0.39/0.42 c # [type: real, range: [0,1], default: 0.5]
0.39/0.42 c heuristics/rens/minfixingrate = 0.3
0.39/0.42 c
0.39/0.42 c # number of nodes added to the contingent of the total nodes
0.39/0.42 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.42 c heuristics/rens/nodesofs = 2000
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.42 c heuristics/rootsoldiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.39/0.42 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/rounding/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/shifting/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/simplerounding/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c heuristics/trivial/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/trysol/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/veclendiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/veclendiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/veclendiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/zirounding/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c separating/cmir/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c separating/flowcover/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c separating/rapidlearning/freq = 0
0.39/0.42 c
0.39/0.42 c -----------------------------------------------------------------------------------------------
0.39/0.42 c start solving
0.39/0.42 c
0.39/0.42 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.42 c 0.2s| 1 | 2 | 0 | - |4283k| 0 | - |1580 |1632 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
4.09/4.15 c * 3.7s| 8513 | 0 | 0 | 0.0 |5588k| 109 | - |1580 |2345 | 0 | 0 | 0 | 818 | 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
4.09/4.15 c
4.09/4.15 c SCIP Status : problem is solved [optimal solution found]
4.09/4.15 c Solving Time (sec) : 3.67
4.09/4.15 c Solving Nodes : 8513
4.09/4.15 c Primal Bound : +0.00000000000000e+00 (1 solutions)
4.09/4.15 c Dual Bound : +0.00000000000000e+00
4.09/4.15 c Gap : 0.00 %
4.09/4.15 s SATISFIABLE
4.09/4.15 v -x84 -x71 -x52 -x90 -x85 -x82 -x77 -x75 -x54 -x56 -x95 -x98 x83 x87 -x51 -x86 -x79 -x72 -x69 -x67 -x63 -x60 -x59 -x58 -x57 -x64
4.09/4.15 v -x97 -x61 -x92 -x66 x73 x53 -x81 -x68 -x74 -x55 -x88 x94 -x100 -x80 -x93 -x96 -x78 -x65 -x99 -x62 -x76 -x89 -x70 -x91 -x50 x49
4.09/4.15 v -x48 -x47 -x46 -x45 -x44 -x43 x42 -x41 -x40 x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 x25 -x24
4.09/4.15 v -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 x7 -x6 -x5 -x4 -x3 -x2 -x1
4.09/4.15 c SCIP Status : problem is solved [optimal solution found]
4.09/4.15 c Solving Time : 3.67
4.09/4.15 c Original Problem :
4.09/4.15 c Problem name : HOME/instance-2663406-1276675105.opb
4.09/4.15 c Variables : 1580 (1580 binary, 0 integer, 0 implicit integer, 0 continuous)
4.09/4.15 c Constraints : 1632 initial, 1632 maximal
4.09/4.15 c Presolved Problem :
4.09/4.15 c Problem name : t_HOME/instance-2663406-1276675105.opb
4.09/4.15 c Variables : 1580 (1580 binary, 0 integer, 0 implicit integer, 0 continuous)
4.09/4.15 c Constraints : 1632 initial, 2345 maximal
4.09/4.15 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
4.09/4.15 c trivial : 0.00 0 0 0 0 0 0 0 0
4.09/4.15 c dualfix : 0.00 0 0 0 0 0 0 0 0
4.09/4.15 c boundshift : 0.00 0 0 0 0 0 0 0 0
4.09/4.15 c inttobinary : 0.00 0 0 0 0 0 0 0 0
4.09/4.15 c implics : 0.00 0 0 0 0 0 0 0 0
4.09/4.15 c probing : 0.00 0 0 0 0 0 0 0 0
4.09/4.15 c knapsack : 0.00 0 0 0 0 0 0 0 0
4.09/4.15 c setppc : 0.01 0 0 0 0 0 0 0 0
4.09/4.15 c and : 0.18 0 0 0 0 0 0 0 0
4.09/4.15 c linear : 0.01 0 0 0 0 0 0 0 0
4.09/4.15 c logicor : 0.00 0 0 0 0 0 0 0 0
4.09/4.15 c root node : - 0 - - 0 - - - -
4.09/4.15 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
4.09/4.15 c integral : 0 0 0 0 0 0 0 0 0 0
4.09/4.15 c knapsack : 1 0 12402 0 5065 43 908 0 0 0
4.09/4.15 c setppc : 100 0 24391 0 8277 512 4588 0 0 0
4.09/4.15 c and : 1480 0 23896 0 8280 0 160583 0 0 0
4.09/4.16 c linear : 1 0 23673 0 8280 41 1139 0 0 0
4.09/4.16 c logicor : 50+ 0 4145 0 8281 11 1752 0 0 0
4.09/4.16 c countsols : 0 0 0 0 8281 0 0 0 0 0
4.09/4.16 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
4.09/4.16 c integral : 0.00 0.00 0.00 0.00 0.00
4.09/4.16 c knapsack : 0.07 0.00 0.05 0.00 0.02
4.09/4.16 c setppc : 0.58 0.00 0.12 0.00 0.46
4.09/4.16 c and : 0.89 0.00 0.60 0.00 0.29
4.09/4.16 c linear : 0.15 0.00 0.15 0.00 0.00
4.09/4.16 c logicor : 0.04 0.00 0.02 0.00 0.02
4.09/4.16 c countsols : 0.00 0.00 0.00 0.00 0.00
4.09/4.16 c Propagators : Time Calls Cutoffs DomReds
4.09/4.16 c vbounds : 0.00 1 0 0
4.09/4.16 c rootredcost : 0.01 0 0 0
4.09/4.16 c pseudoobj : 0.01 0 0 0
4.09/4.16 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
4.09/4.16 c propagation : 0.08 607 590 856 31.8 3 49.0 -
4.09/4.16 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
4.09/4.16 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
4.09/4.16 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
4.09/4.16 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
4.09/4.16 c applied globally : - - - 818 29.2 - - -
4.09/4.16 c applied locally : - - - 0 0.0 - - -
4.09/4.16 c Separators : Time Calls Cutoffs DomReds Cuts Conss
4.09/4.16 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
4.09/4.16 c redcost : 0.00 0 0 0 0 0
4.09/4.16 c impliedbounds : 0.00 0 0 0 0 0
4.09/4.16 c intobj : 0.00 0 0 0 0 0
4.09/4.16 c cgmip : 0.00 0 0 0 0 0
4.09/4.16 c gomory : 0.00 0 0 0 0 0
4.09/4.16 c strongcg : 0.00 0 0 0 0 0
4.09/4.16 c cmir : 0.00 0 0 0 0 0
4.09/4.16 c flowcover : 0.00 0 0 0 0 0
4.09/4.16 c clique : 0.00 0 0 0 0 0
4.09/4.16 c zerohalf : 0.00 0 0 0 0 0
4.09/4.16 c mcf : 0.00 0 0 0 0 0
4.09/4.16 c rapidlearning : 0.00 0 0 0 0 0
4.09/4.16 c Pricers : Time Calls Vars
4.09/4.16 c problem variables: 0.00 0 0
4.09/4.16 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
4.09/4.16 c relpscost : 0.00 0 0 0 0 0 0
4.09/4.16 c pscost : 0.00 0 0 0 0 0 0
4.09/4.16 c inference : 0.80 8280 0 0 0 0 16560
4.09/4.16 c mostinf : 0.00 0 0 0 0 0 0
4.09/4.16 c leastinf : 0.00 0 0 0 0 0 0
4.09/4.16 c fullstrong : 0.00 0 0 0 0 0 0
4.09/4.16 c allfullstrong : 0.00 0 0 0 0 0 0
4.09/4.16 c random : 0.00 0 0 0 0 0 0
4.09/4.16 c Primal Heuristics : Time Calls Found
4.09/4.16 c LP solutions : 0.00 - 0
4.09/4.16 c pseudo solutions : 0.01 - 1
4.09/4.16 c trivial : 0.00 1 0
4.09/4.16 c simplerounding : 0.00 0 0
4.09/4.16 c zirounding : 0.00 0 0
4.09/4.16 c rounding : 0.00 0 0
4.09/4.16 c shifting : 0.00 0 0
4.09/4.16 c intshifting : 0.00 0 0
4.09/4.16 c oneopt : 0.00 0 0
4.09/4.16 c twoopt : 0.00 0 0
4.09/4.16 c fixandinfer : 0.00 0 0
4.09/4.16 c feaspump : 0.00 0 0
4.09/4.16 c coefdiving : 0.00 0 0
4.09/4.16 c pscostdiving : 0.00 0 0
4.09/4.16 c fracdiving : 0.00 0 0
4.09/4.16 c veclendiving : 0.00 0 0
4.09/4.16 c intdiving : 0.00 0 0
4.09/4.16 c actconsdiving : 0.00 0 0
4.09/4.16 c objpscostdiving : 0.00 0 0
4.09/4.16 c rootsoldiving : 0.00 0 0
4.09/4.16 c linesearchdiving : 0.00 0 0
4.09/4.16 c guideddiving : 0.00 0 0
4.09/4.16 c octane : 0.00 0 0
4.09/4.16 c rens : 0.00 0 0
4.09/4.16 c rins : 0.00 0 0
4.09/4.16 c localbranching : 0.00 0 0
4.09/4.16 c mutation : 0.00 0 0
4.09/4.16 c crossover : 0.00 0 0
4.09/4.16 c dins : 0.00 0 0
4.09/4.16 c undercover : 0.00 0 0
4.09/4.16 c nlp : 0.00 0 0
4.09/4.16 c trysol : 0.00 0 0
4.09/4.16 c LP : Time Calls Iterations Iter/call Iter/sec
4.09/4.16 c primal LP : 0.00 0 0 0.00 -
4.09/4.16 c dual LP : 0.00 0 0 0.00 -
4.09/4.16 c lex dual LP : 0.00 0 0 0.00 -
4.09/4.16 c barrier LP : 0.00 0 0 0.00 -
4.09/4.16 c diving/probing LP: 0.00 0 0 0.00 -
4.09/4.16 c strong branching : 0.00 0 0 0.00 -
4.09/4.16 c (at root node) : - 0 0 0.00 -
4.09/4.16 c conflict analysis: 0.00 0 0 0.00 -
4.09/4.16 c B&B Tree :
4.09/4.16 c number of runs : 1
4.09/4.16 c nodes : 8513
4.09/4.16 c nodes (total) : 8513
4.09/4.16 c nodes left : 0
4.09/4.16 c max depth : 109
4.09/4.16 c max depth (total): 109
4.09/4.16 c backtracks : 392 (4.6%)
4.09/4.16 c delayed cutoffs : 375
4.09/4.16 c repropagations : 5737 (7344 domain reductions, 375 cutoffs)
4.09/4.16 c avg switch length: 3.63
4.09/4.16 c switching time : 0.59
4.09/4.16 c Solution :
4.09/4.16 c Solutions found : 1 (1 improvements)
4.09/4.16 c First Solution : +0.00000000000000e+00 (in run 1, after 8513 nodes, 3.65 seconds, depth 30, found by <relaxation>)
4.09/4.16 c Primal Bound : +0.00000000000000e+00 (in run 1, after 8513 nodes, 3.65 seconds, depth 30, found by <relaxation>)
4.09/4.16 c Dual Bound : +0.00000000000000e+00
4.09/4.16 c Gap : 0.00 %
4.09/4.16 c Root Dual Bound : +0.00000000000000e+00
4.09/4.16 c Root Iterations : 0
4.09/4.17 c Time complete: 4.16.