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-2663452-1276679377.opb>
0.01/0.02 c original problem has 1576 variables (1576 bin, 0 int, 0 impl, 0 cont) and 1628 constraints
0.01/0.02 c problem read
0.01/0.02 c No objective function, only one solution is needed.
0.01/0.02 c presolving settings loaded
0.01/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.01/0.04 c presolving:
0.19/0.22 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 11908 impls, 100 clqs
0.29/0.39 c presolving (2 rounds):
0.29/0.39 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.39 c 11908 implications, 100 cliques
0.29/0.39 c presolved problem has 1576 variables (1576 bin, 0 int, 0 impl, 0 cont) and 1628 constraints
0.29/0.39 c 1 constraints of type <knapsack>
0.29/0.39 c 100 constraints of type <setppc>
0.29/0.39 c 1476 constraints of type <and>
0.29/0.39 c 1 constraints of type <linear>
0.29/0.39 c 50 constraints of type <logicor>
0.29/0.39 c transformed objective value is always integral (scale: 1)
0.29/0.39 c Presolving Time: 0.19
0.29/0.39 c - non default parameters ----------------------------------------------------------------------
0.29/0.39 c # SCIP version 1.2.1.2
0.29/0.39 c
0.29/0.39 c # frequency for displaying node information lines
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.39 c display/freq = 10000
0.29/0.39 c
0.29/0.39 c # maximal time in seconds to run
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.39 c limits/time = 1799.98
0.29/0.39 c
0.29/0.39 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.39 c limits/memory = 1620
0.29/0.39 c
0.29/0.39 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c limits/solutions = 1
0.29/0.39 c
0.29/0.39 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c lp/solvefreq = -1
0.29/0.39 c
0.29/0.39 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.39 c separating/maxrounds = 1
0.29/0.39 c
0.29/0.39 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c separating/maxroundsroot = 5
0.29/0.39 c
0.29/0.39 c # should presolving try to simplify inequalities
0.29/0.39 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.39 c constraints/linear/simplifyinequalities = TRUE
0.29/0.39 c
0.29/0.39 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.39 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.39 c constraints/knapsack/disaggregation = FALSE
0.29/0.39 c
0.29/0.39 c # should presolving try to simplify knapsacks
0.29/0.39 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.39 c constraints/knapsack/simplifyinequalities = TRUE
0.29/0.39 c
0.29/0.39 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c presolving/probing/maxrounds = 0
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/coefdiving/freq = -1
0.29/0.39 c
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/coefdiving/maxlpiterquot = 0.075
0.29/0.39 c
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/coefdiving/maxlpiterofs = 1500
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.39 c heuristics/crossover/freq = -1
0.29/0.39 c
0.29/0.39 c # number of nodes added to the contingent of the total nodes
0.29/0.39 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.39 c heuristics/crossover/nodesofs = 750
0.29/0.39 c
0.29/0.39 c # number of nodes without incumbent change that heuristic should wait
0.29/0.39 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.39 c heuristics/crossover/nwaitingnodes = 100
0.29/0.39 c
0.29/0.39 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.39 c # [type: real, range: [0,1], default: 0.1]
0.29/0.39 c heuristics/crossover/nodesquot = 0.15
0.29/0.39 c
0.29/0.39 c # minimum percentage of integer variables that have to be fixed
0.29/0.39 c # [type: real, range: [0,1], default: 0.666]
0.29/0.39 c heuristics/crossover/minfixingrate = 0.5
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.39 c heuristics/feaspump/freq = -1
0.29/0.39 c
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/feaspump/maxlpiterofs = 2000
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/fracdiving/freq = -1
0.29/0.39 c
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/fracdiving/maxlpiterquot = 0.075
0.29/0.39 c
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/fracdiving/maxlpiterofs = 1500
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/guideddiving/freq = -1
0.29/0.39 c
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/guideddiving/maxlpiterquot = 0.075
0.29/0.39 c
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/guideddiving/maxlpiterofs = 1500
0.29/0.39 c
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/intdiving/maxlpiterquot = 0.075
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/intshifting/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/linesearchdiving/freq = -1
0.29/0.39 c
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.29/0.39 c
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/nlp/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.39 c heuristics/objpscostdiving/freq = -1
0.29/0.39 c
0.29/0.39 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.39 c # [type: real, range: [0,1], default: 0.01]
0.29/0.39 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.29/0.39 c
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/oneopt/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/pscostdiving/freq = -1
0.29/0.39 c
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.29/0.39 c
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/pscostdiving/maxlpiterofs = 1500
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39 c heuristics/rens/freq = -1
0.29/0.39 c
0.29/0.39 c # minimum percentage of integer variables that have to be fixable
0.29/0.39 c # [type: real, range: [0,1], default: 0.5]
0.29/0.39 c heuristics/rens/minfixingrate = 0.3
0.29/0.39 c
0.29/0.39 c # number of nodes added to the contingent of the total nodes
0.29/0.39 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.39 c heuristics/rens/nodesofs = 2000
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.39 c heuristics/rootsoldiving/freq = -1
0.29/0.39 c
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.39 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.29/0.39 c
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/rounding/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/shifting/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/simplerounding/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39 c heuristics/trivial/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/trysol/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/veclendiving/freq = -1
0.29/0.39 c
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/veclendiving/maxlpiterquot = 0.075
0.29/0.39 c
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/veclendiving/maxlpiterofs = 1500
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/zirounding/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39 c separating/cmir/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39 c separating/flowcover/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c separating/rapidlearning/freq = 0
0.29/0.39 c
0.29/0.39 c -----------------------------------------------------------------------------------------------
0.29/0.39 c start solving
0.29/0.39 c
0.29/0.39 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.39 c 0.2s| 1 | 2 | 0 | - |4271k| 0 | - |1576 |1628 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
4.69/4.71 c 4.2s| 10000 | 8979 | 0 | 0.0 | 18M| 94 | - |1576 |2394 | 0 | 0 | 0 |1034 | 0 | 0.000000e+00 | -- | Inf
5.89/5.97 c * 5.4s| 13022 | 0 | 0 | 0.0 |5673k| 94 | - |1576 |2459 | 0 | 0 | 0 |1248 | 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
5.89/5.98 c
5.89/5.98 c SCIP Status : problem is solved [optimal solution found]
5.89/5.98 c Solving Time (sec) : 5.37
5.89/5.98 c Solving Nodes : 13022
5.89/5.98 c Primal Bound : +0.00000000000000e+00 (1 solutions)
5.89/5.98 c Dual Bound : +0.00000000000000e+00
5.89/5.98 c Gap : 0.00 %
5.89/5.98 s SATISFIABLE
5.89/5.98 v -x70 -x61 -x84 -x78 -x64 -x63 -x58 -x54 -x72 -x100 -x83 -x82 -x95 -x79 -x62 -x51 -x85 -x81 -x80 -x71 -x68 x67 -x60 -x57 -x56 -x87
5.89/5.98 v -x55 -x99 -x88 x98 -x74 -x89 -x93 -x66 -x96 x92 -x53 -x90 -x94 -x75 -x59 -x65 -x52 x77 -x73 -x76 -x91 -x69 -x86 x97 -x50 -x49
5.89/5.98 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
5.89/5.98 v -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 x7 -x6 -x5 -x4 -x3 -x2 -x1
5.89/5.98 c SCIP Status : problem is solved [optimal solution found]
5.89/5.98 c Solving Time : 5.37
5.89/5.98 c Original Problem :
5.89/5.98 c Problem name : HOME/instance-2663452-1276679377.opb
5.89/5.98 c Variables : 1576 (1576 binary, 0 integer, 0 implicit integer, 0 continuous)
5.89/5.98 c Constraints : 1628 initial, 1628 maximal
5.89/5.98 c Presolved Problem :
5.89/5.98 c Problem name : t_HOME/instance-2663452-1276679377.opb
5.89/5.98 c Variables : 1576 (1576 binary, 0 integer, 0 implicit integer, 0 continuous)
5.89/5.98 c Constraints : 1628 initial, 2459 maximal
5.89/5.98 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
5.89/5.98 c trivial : 0.00 0 0 0 0 0 0 0 0
5.89/5.98 c dualfix : 0.00 0 0 0 0 0 0 0 0
5.89/5.98 c boundshift : 0.00 0 0 0 0 0 0 0 0
5.89/5.98 c inttobinary : 0.00 0 0 0 0 0 0 0 0
5.89/5.98 c implics : 0.00 0 0 0 0 0 0 0 0
5.89/5.98 c probing : 0.00 0 0 0 0 0 0 0 0
5.89/5.98 c knapsack : 0.00 0 0 0 0 0 0 0 0
5.89/5.98 c setppc : 0.00 0 0 0 0 0 0 0 0
5.89/5.98 c and : 0.18 0 0 0 0 0 0 0 0
5.89/5.98 c linear : 0.00 0 0 0 0 0 0 0 0
5.89/5.98 c logicor : 0.01 0 0 0 0 0 0 0 0
5.89/5.98 c root node : - 0 - - 0 - - - -
5.89/5.98 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
5.89/5.98 c integral : 0 0 0 0 0 0 0 0 0 0
5.89/5.98 c knapsack : 1 0 18453 0 7724 65 1264 0 0 0
5.89/5.98 c setppc : 100 0 37073 0 12687 781 7572 0 0 0
5.89/5.98 c and : 1476 0 36292 0 12687 0 254414 0 0 0
5.89/5.98 c linear : 1 0 35971 0 12687 42 1590 0 0 0
5.89/5.98 c logicor : 50+ 0 6495 0 12686 12 2593 0 0 0
5.89/5.98 c countsols : 0 0 0 0 12688 0 0 0 0 0
5.89/5.98 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
5.89/5.98 c integral : 0.00 0.00 0.00 0.00 0.00
5.89/5.98 c knapsack : 0.06 0.00 0.05 0.00 0.01
5.89/5.98 c setppc : 0.86 0.00 0.15 0.00 0.71
5.89/5.98 c and : 1.10 0.00 0.64 0.00 0.46
5.89/5.98 c linear : 0.32 0.00 0.32 0.00 0.00
5.89/5.98 c logicor : 0.22 0.00 0.18 0.00 0.04
5.89/5.98 c countsols : 0.01 0.00 0.00 0.00 0.01
5.89/5.98 c Propagators : Time Calls Cutoffs DomReds
5.89/5.98 c vbounds : 0.02 1 0 0
5.89/5.98 c rootredcost : 0.03 0 0 0
5.89/5.98 c pseudoobj : 0.02 0 0 0
5.89/5.98 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
5.89/5.98 c propagation : 0.10 900 875 1283 29.6 3 64.0 -
5.89/5.98 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
5.89/5.98 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
5.89/5.98 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
5.89/5.98 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
5.89/5.98 c applied globally : - - - 1248 28.5 - - -
5.89/5.98 c applied locally : - - - 0 0.0 - - -
5.89/5.98 c Separators : Time Calls Cutoffs DomReds Cuts Conss
5.89/5.98 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
5.89/5.98 c redcost : 0.00 0 0 0 0 0
5.89/5.98 c impliedbounds : 0.00 0 0 0 0 0
5.89/5.98 c intobj : 0.00 0 0 0 0 0
5.89/5.98 c cgmip : 0.00 0 0 0 0 0
5.89/5.98 c gomory : 0.00 0 0 0 0 0
5.89/5.98 c strongcg : 0.00 0 0 0 0 0
5.89/5.98 c cmir : 0.00 0 0 0 0 0
5.89/5.98 c flowcover : 0.00 0 0 0 0 0
5.89/5.98 c clique : 0.00 0 0 0 0 0
5.89/5.98 c zerohalf : 0.00 0 0 0 0 0
5.89/5.98 c mcf : 0.00 0 0 0 0 0
5.89/5.98 c rapidlearning : 0.00 0 0 0 0 0
5.89/5.98 c Pricers : Time Calls Vars
5.89/5.98 c problem variables: 0.00 0 0
5.89/5.98 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
5.89/5.98 c relpscost : 0.00 0 0 0 0 0 0
5.89/5.98 c pscost : 0.00 0 0 0 0 0 0
5.89/5.98 c inference : 1.06 12687 0 0 0 0 25374
5.89/5.98 c mostinf : 0.00 0 0 0 0 0 0
5.89/5.98 c leastinf : 0.00 0 0 0 0 0 0
5.89/5.98 c fullstrong : 0.00 0 0 0 0 0 0
5.89/5.98 c allfullstrong : 0.00 0 0 0 0 0 0
5.89/5.98 c random : 0.00 0 0 0 0 0 0
5.89/5.98 c Primal Heuristics : Time Calls Found
5.89/5.98 c LP solutions : 0.00 - 0
5.89/5.98 c pseudo solutions : 0.03 - 1
5.89/5.98 c trivial : 0.00 1 0
5.89/5.98 c simplerounding : 0.00 0 0
5.89/5.98 c zirounding : 0.00 0 0
5.89/5.98 c rounding : 0.00 0 0
5.89/5.98 c shifting : 0.00 0 0
5.89/5.98 c intshifting : 0.00 0 0
5.89/5.98 c oneopt : 0.00 0 0
5.89/5.98 c twoopt : 0.00 0 0
5.89/5.98 c fixandinfer : 0.00 0 0
5.89/5.98 c feaspump : 0.00 0 0
5.89/5.98 c coefdiving : 0.00 0 0
5.89/5.98 c pscostdiving : 0.00 0 0
5.89/5.98 c fracdiving : 0.00 0 0
5.89/5.98 c veclendiving : 0.00 0 0
5.89/5.98 c intdiving : 0.00 0 0
5.89/5.98 c actconsdiving : 0.00 0 0
5.89/5.98 c objpscostdiving : 0.00 0 0
5.89/5.98 c rootsoldiving : 0.00 0 0
5.89/5.98 c linesearchdiving : 0.00 0 0
5.89/5.98 c guideddiving : 0.00 0 0
5.89/5.98 c octane : 0.00 0 0
5.89/5.98 c rens : 0.00 0 0
5.89/5.98 c rins : 0.00 0 0
5.89/5.98 c localbranching : 0.00 0 0
5.89/5.98 c mutation : 0.00 0 0
5.89/5.98 c crossover : 0.00 0 0
5.89/5.98 c dins : 0.00 0 0
5.89/5.98 c undercover : 0.00 0 0
5.89/5.98 c nlp : 0.00 0 0
5.89/5.98 c trysol : 0.00 0 0
5.89/5.98 c LP : Time Calls Iterations Iter/call Iter/sec
5.89/5.98 c primal LP : 0.00 0 0 0.00 -
5.89/5.98 c dual LP : 0.00 0 0 0.00 -
5.89/5.98 c lex dual LP : 0.00 0 0 0.00 -
5.89/5.98 c barrier LP : 0.00 0 0 0.00 -
5.89/5.98 c diving/probing LP: 0.00 0 0 0.00 -
5.89/5.98 c strong branching : 0.00 0 0 0.00 -
5.89/5.98 c (at root node) : - 0 0 0.00 -
5.89/5.98 c conflict analysis: 0.00 0 0 0.00 -
5.89/5.98 c B&B Tree :
5.89/5.98 c number of runs : 1
5.89/5.98 c nodes : 13022
5.89/5.98 c nodes (total) : 13022
5.89/5.98 c nodes left : 0
5.89/5.98 c max depth : 94
5.89/5.98 c max depth (total): 94
5.89/5.98 c backtracks : 588 (4.5%)
5.89/5.98 c delayed cutoffs : 566
5.89/5.98 c repropagations : 8524 (10927 domain reductions, 566 cutoffs)
5.89/5.98 c avg switch length: 3.67
5.89/5.98 c switching time : 0.98
5.89/5.98 c Solution :
5.89/5.98 c Solutions found : 1 (1 improvements)
5.89/5.98 c First Solution : +0.00000000000000e+00 (in run 1, after 13022 nodes, 5.34 seconds, depth 66, found by <relaxation>)
5.89/5.98 c Primal Bound : +0.00000000000000e+00 (in run 1, after 13022 nodes, 5.34 seconds, depth 66, found by <relaxation>)
5.89/5.98 c Dual Bound : +0.00000000000000e+00
5.89/5.98 c Gap : 0.00 %
5.89/5.98 c Root Dual Bound : +0.00000000000000e+00
5.89/5.98 c Root Iterations : 0
5.99/6.00 c Time complete: 5.99.