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-2663429-1276677503.opb>
0.00/0.02 c original problem has 1566 variables (1566 bin, 0 int, 0 impl, 0 cont) and 1618 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.00/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, 11828 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 11828 implications, 100 cliques
0.29/0.39 c presolved problem has 1566 variables (1566 bin, 0 int, 0 impl, 0 cont) and 1618 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 1466 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.17
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.99
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 | - |4245k| 0 | - |1566 |1618 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1.39/1.40 c * 1.1s| 3011 | 0 | 0 | 0.0 |5044k| 94 | - |1566 |1834 | 0 | 0 | 0 | 216 | 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
1.39/1.40 c
1.39/1.40 c SCIP Status : problem is solved [optimal solution found]
1.39/1.40 c Solving Time (sec) : 1.12
1.39/1.40 c Solving Nodes : 3011
1.39/1.40 c Primal Bound : +0.00000000000000e+00 (1 solutions)
1.39/1.40 c Dual Bound : +0.00000000000000e+00
1.39/1.40 c Gap : 0.00 %
1.39/1.40 s SATISFIABLE
1.39/1.40 v -x59 -x66 -x97 -x60 -x58 -x56 -x96 -x87 -x72 -x90 -x98 -x94 -x93 -x82 -x62 -x70 -x51 -x99 -x91 x89 -x85 -x78 -x67 -x63 -x61 -x57
1.39/1.40 v x81 -x71 x83 -x73 -x74 x80 -x69 -x68 x100 -x92 -x53 -x54 -x65 -x55 -x95 -x86 -x79 -x76 -x88 -x64 -x77 -x75 -x84 -x52 -x50 x49
1.39/1.40 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
1.39/1.40 v -x23 -x22 -x21 -x20 -x19 -x18 x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
1.39/1.40 c SCIP Status : problem is solved [optimal solution found]
1.39/1.40 c Solving Time : 1.12
1.39/1.40 c Original Problem :
1.39/1.40 c Problem name : HOME/instance-2663429-1276677503.opb
1.39/1.40 c Variables : 1566 (1566 binary, 0 integer, 0 implicit integer, 0 continuous)
1.39/1.40 c Constraints : 1618 initial, 1618 maximal
1.39/1.40 c Presolved Problem :
1.39/1.40 c Problem name : t_HOME/instance-2663429-1276677503.opb
1.39/1.40 c Variables : 1566 (1566 binary, 0 integer, 0 implicit integer, 0 continuous)
1.39/1.40 c Constraints : 1618 initial, 1834 maximal
1.39/1.40 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.39/1.40 c trivial : 0.00 0 0 0 0 0 0 0 0
1.39/1.40 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.39/1.40 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.39/1.40 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.39/1.40 c implics : 0.00 0 0 0 0 0 0 0 0
1.39/1.40 c probing : 0.00 0 0 0 0 0 0 0 0
1.39/1.40 c knapsack : 0.00 0 0 0 0 0 0 0 0
1.39/1.40 c setppc : 0.00 0 0 0 0 0 0 0 0
1.39/1.40 c and : 0.15 0 0 0 0 0 0 0 0
1.39/1.40 c linear : 0.01 0 0 0 0 0 0 0 0
1.39/1.40 c logicor : 0.00 0 0 0 0 0 0 0 0
1.39/1.40 c root node : - 0 - - 0 - - - -
1.39/1.40 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.39/1.40 c integral : 0 0 0 0 0 0 0 0 0 0
1.39/1.40 c knapsack : 1 0 4522 0 2129 32 372 0 0 0
1.39/1.40 c setppc : 100 0 7274 0 2928 144 1711 0 0 0
1.39/1.40 c and : 1466 0 7138 0 2930 0 43572 0 0 0
1.39/1.40 c linear : 1 0 7093 0 2930 11 258 0 0 0
1.39/1.40 c logicor : 50+ 0 606 0 2931 1 625 0 0 0
1.39/1.40 c countsols : 0 0 0 0 2931 0 0 0 0 0
1.39/1.40 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.39/1.40 c integral : 0.00 0.00 0.00 0.00 0.00
1.39/1.40 c knapsack : 0.02 0.00 0.02 0.00 0.00
1.39/1.40 c setppc : 0.12 0.00 0.04 0.00 0.08
1.39/1.40 c and : 0.24 0.00 0.13 0.00 0.11
1.39/1.40 c linear : 0.08 0.00 0.08 0.00 0.00
1.39/1.40 c logicor : 0.02 0.00 0.00 0.00 0.02
1.39/1.40 c countsols : 0.00 0.00 0.00 0.00 0.00
1.39/1.40 c Propagators : Time Calls Cutoffs DomReds
1.39/1.40 c vbounds : 0.00 1 0 0
1.39/1.40 c rootredcost : 0.00 0 0 0
1.39/1.40 c pseudoobj : 0.00 0 0 0
1.39/1.40 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.39/1.40 c propagation : 0.01 188 185 222 35.6 0 0.0 -
1.39/1.40 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.39/1.40 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.39/1.40 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.39/1.40 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.39/1.40 c applied globally : - - - 216 34.3 - - -
1.39/1.40 c applied locally : - - - 0 0.0 - - -
1.39/1.40 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.39/1.40 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.39/1.40 c redcost : 0.00 0 0 0 0 0
1.39/1.40 c impliedbounds : 0.00 0 0 0 0 0
1.39/1.40 c intobj : 0.00 0 0 0 0 0
1.39/1.40 c cgmip : 0.00 0 0 0 0 0
1.39/1.40 c gomory : 0.00 0 0 0 0 0
1.39/1.40 c strongcg : 0.00 0 0 0 0 0
1.39/1.40 c cmir : 0.00 0 0 0 0 0
1.39/1.40 c flowcover : 0.00 0 0 0 0 0
1.39/1.40 c clique : 0.00 0 0 0 0 0
1.39/1.40 c zerohalf : 0.00 0 0 0 0 0
1.39/1.40 c mcf : 0.00 0 0 0 0 0
1.39/1.40 c rapidlearning : 0.00 0 0 0 0 0
1.39/1.40 c Pricers : Time Calls Vars
1.39/1.40 c problem variables: 0.00 0 0
1.39/1.40 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.39/1.40 c relpscost : 0.00 0 0 0 0 0 0
1.39/1.40 c pscost : 0.00 0 0 0 0 0 0
1.39/1.40 c inference : 0.25 2930 0 0 0 0 5860
1.39/1.40 c mostinf : 0.00 0 0 0 0 0 0
1.39/1.40 c leastinf : 0.00 0 0 0 0 0 0
1.39/1.40 c fullstrong : 0.00 0 0 0 0 0 0
1.39/1.40 c allfullstrong : 0.00 0 0 0 0 0 0
1.39/1.40 c random : 0.00 0 0 0 0 0 0
1.39/1.40 c Primal Heuristics : Time Calls Found
1.39/1.40 c LP solutions : 0.00 - 0
1.39/1.40 c pseudo solutions : 0.00 - 1
1.39/1.40 c trivial : 0.01 1 0
1.39/1.40 c simplerounding : 0.00 0 0
1.39/1.40 c zirounding : 0.00 0 0
1.39/1.40 c rounding : 0.00 0 0
1.39/1.40 c shifting : 0.00 0 0
1.39/1.40 c intshifting : 0.00 0 0
1.39/1.40 c oneopt : 0.00 0 0
1.39/1.40 c twoopt : 0.00 0 0
1.39/1.40 c fixandinfer : 0.00 0 0
1.39/1.40 c feaspump : 0.00 0 0
1.39/1.40 c coefdiving : 0.00 0 0
1.39/1.40 c pscostdiving : 0.00 0 0
1.39/1.40 c fracdiving : 0.00 0 0
1.39/1.40 c veclendiving : 0.00 0 0
1.39/1.40 c intdiving : 0.00 0 0
1.39/1.40 c actconsdiving : 0.00 0 0
1.39/1.40 c objpscostdiving : 0.00 0 0
1.39/1.40 c rootsoldiving : 0.00 0 0
1.39/1.40 c linesearchdiving : 0.00 0 0
1.39/1.40 c guideddiving : 0.00 0 0
1.39/1.40 c octane : 0.00 0 0
1.39/1.40 c rens : 0.00 0 0
1.39/1.40 c rins : 0.00 0 0
1.39/1.40 c localbranching : 0.00 0 0
1.39/1.40 c mutation : 0.00 0 0
1.39/1.40 c crossover : 0.00 0 0
1.39/1.40 c dins : 0.00 0 0
1.39/1.40 c undercover : 0.00 0 0
1.39/1.40 c nlp : 0.00 0 0
1.39/1.40 c trysol : 0.00 0 0
1.39/1.40 c LP : Time Calls Iterations Iter/call Iter/sec
1.39/1.40 c primal LP : 0.00 0 0 0.00 -
1.39/1.40 c dual LP : 0.00 0 0 0.00 -
1.39/1.40 c lex dual LP : 0.00 0 0 0.00 -
1.39/1.40 c barrier LP : 0.00 0 0 0.00 -
1.39/1.40 c diving/probing LP: 0.00 0 0 0.00 -
1.39/1.40 c strong branching : 0.00 0 0 0.00 -
1.39/1.40 c (at root node) : - 0 0 0.00 -
1.39/1.40 c conflict analysis: 0.00 0 0 0.00 -
1.39/1.40 c B&B Tree :
1.39/1.40 c number of runs : 1
1.39/1.40 c nodes : 3011
1.39/1.40 c nodes (total) : 3011
1.39/1.40 c nodes left : 0
1.39/1.40 c max depth : 94
1.39/1.40 c max depth (total): 94
1.39/1.40 c backtracks : 113 (3.8%)
1.39/1.40 c delayed cutoffs : 108
1.39/1.40 c repropagations : 862 (2540 domain reductions, 108 cutoffs)
1.39/1.40 c avg switch length: 2.82
1.39/1.40 c switching time : 0.12
1.39/1.40 c Solution :
1.39/1.40 c Solutions found : 1 (1 improvements)
1.39/1.40 c First Solution : +0.00000000000000e+00 (in run 1, after 3011 nodes, 1.11 seconds, depth 82, found by <relaxation>)
1.39/1.40 c Primal Bound : +0.00000000000000e+00 (in run 1, after 3011 nodes, 1.11 seconds, depth 82, found by <relaxation>)
1.39/1.40 c Dual Bound : +0.00000000000000e+00
1.39/1.40 c Gap : 0.00 %
1.39/1.40 c Root Dual Bound : +0.00000000000000e+00
1.39/1.40 c Root Iterations : 0
1.39/1.42 c Time complete: 1.41.