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