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-2664545-1276332818.opb>
1.30/1.33 c original problem has 25800 variables (25800 bin, 0 int, 0 impl, 0 cont) and 76699 constraints
1.30/1.33 c problem read
1.30/1.33 c No objective function, only one solution is needed.
1.30/1.34 c presolving settings loaded
1.30/1.34 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
1.69/1.72 c presolving:
3.59/3.66 c (round 1) 764 del vars, 747 del conss, 324 chg bounds, 190 chg sides, 598 chg coeffs, 0 upgd conss, 2198185 impls, 0 clqs
3.89/3.93 c (round 2) 980 del vars, 2282 del conss, 473 chg bounds, 190 chg sides, 598 chg coeffs, 0 upgd conss, 2200719 impls, 0 clqs
3.99/4.03 c (round 3) 980 del vars, 2469 del conss, 473 chg bounds, 190 chg sides, 598 chg coeffs, 0 upgd conss, 2201507 impls, 0 clqs
4.78/4.81 c (round 4) 980 del vars, 2480 del conss, 473 chg bounds, 190 chg sides, 598 chg coeffs, 74219 upgd conss, 2201507 impls, 0 clqs
4.89/4.99 c presolving (5 rounds):
4.89/4.99 c 980 deleted vars, 2480 deleted constraints, 473 tightened bounds, 0 added holes, 190 changed sides, 598 changed coefficients
4.89/4.99 c 2201507 implications, 0 cliques
4.89/4.99 c presolved problem has 24820 variables (24820 bin, 0 int, 0 impl, 0 cont) and 74219 constraints
4.89/4.99 c 380 constraints of type <knapsack>
4.89/4.99 c 73839 constraints of type <logicor>
4.89/4.99 c transformed objective value is always integral (scale: 1)
4.89/4.99 c Presolving Time: 2.96
4.89/4.99 c - non default parameters ----------------------------------------------------------------------
4.89/4.99 c # SCIP version 1.2.1.2
4.89/4.99 c
4.89/4.99 c # frequency for displaying node information lines
4.89/4.99 c # [type: int, range: [-1,2147483647], default: 100]
4.89/4.99 c display/freq = 10000
4.89/4.99 c
4.89/4.99 c # maximal time in seconds to run
4.89/4.99 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
4.89/4.99 c limits/time = 1798.67
4.89/4.99 c
4.89/4.99 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
4.89/4.99 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
4.89/4.99 c limits/memory = 1620
4.89/4.99 c
4.89/4.99 c # solving stops, if the given number of solutions were found (-1: no limit)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: -1]
4.89/4.99 c limits/solutions = 1
4.89/4.99 c
4.89/4.99 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: 1]
4.89/4.99 c lp/solvefreq = -1
4.89/4.99 c
4.89/4.99 c # maximal number of separation rounds per node (-1: unlimited)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: 5]
4.89/4.99 c separating/maxrounds = 1
4.89/4.99 c
4.89/4.99 c # maximal number of separation rounds in the root node (-1: unlimited)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: -1]
4.89/4.99 c separating/maxroundsroot = 5
4.89/4.99 c
4.89/4.99 c # should presolving try to simplify inequalities
4.89/4.99 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.89/4.99 c constraints/linear/simplifyinequalities = TRUE
4.89/4.99 c
4.89/4.99 c # should disaggregation of knapsack constraints be allowed in preprocessing?
4.89/4.99 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
4.89/4.99 c constraints/knapsack/disaggregation = FALSE
4.89/4.99 c
4.89/4.99 c # should presolving try to simplify knapsacks
4.89/4.99 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.89/4.99 c constraints/knapsack/simplifyinequalities = TRUE
4.89/4.99 c
4.89/4.99 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: -1]
4.89/4.99 c presolving/probing/maxrounds = 0
4.89/4.99 c
4.89/4.99 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: 10]
4.89/4.99 c heuristics/coefdiving/freq = -1
4.89/4.99 c
4.89/4.99 c # maximal fraction of diving LP iterations compared to node LP iterations
4.89/4.99 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.89/4.99 c heuristics/coefdiving/maxlpiterquot = 0.075
4.89/4.99 c
4.89/4.99 c # additional number of allowed LP iterations
4.89/4.99 c # [type: int, range: [0,2147483647], default: 1000]
4.89/4.99 c heuristics/coefdiving/maxlpiterofs = 1500
4.89/4.99 c
4.89/4.99 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: 30]
4.89/4.99 c heuristics/crossover/freq = -1
4.89/4.99 c
4.89/4.99 c # number of nodes added to the contingent of the total nodes
4.89/4.99 c # [type: longint, range: [0,9223372036854775807], default: 500]
4.89/4.99 c heuristics/crossover/nodesofs = 750
4.89/4.99 c
4.89/4.99 c # number of nodes without incumbent change that heuristic should wait
4.89/4.99 c # [type: longint, range: [0,9223372036854775807], default: 200]
4.89/4.99 c heuristics/crossover/nwaitingnodes = 100
4.89/4.99 c
4.89/4.99 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
4.89/4.99 c # [type: real, range: [0,1], default: 0.1]
4.89/4.99 c heuristics/crossover/nodesquot = 0.15
4.89/4.99 c
4.89/4.99 c # minimum percentage of integer variables that have to be fixed
4.89/4.99 c # [type: real, range: [0,1], default: 0.666]
4.89/4.99 c heuristics/crossover/minfixingrate = 0.5
4.89/4.99 c
4.89/4.99 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: 20]
4.89/4.99 c heuristics/feaspump/freq = -1
4.89/4.99 c
4.89/4.99 c # additional number of allowed LP iterations
4.89/4.99 c # [type: int, range: [0,2147483647], default: 1000]
4.89/4.99 c heuristics/feaspump/maxlpiterofs = 2000
4.89/4.99 c
4.89/4.99 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: 10]
4.89/4.99 c heuristics/fracdiving/freq = -1
4.89/4.99 c
4.89/4.99 c # maximal fraction of diving LP iterations compared to node LP iterations
4.89/4.99 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.89/4.99 c heuristics/fracdiving/maxlpiterquot = 0.075
4.89/4.99 c
4.89/4.99 c # additional number of allowed LP iterations
4.89/4.99 c # [type: int, range: [0,2147483647], default: 1000]
4.89/4.99 c heuristics/fracdiving/maxlpiterofs = 1500
4.89/4.99 c
4.89/4.99 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: 10]
4.89/4.99 c heuristics/guideddiving/freq = -1
4.89/4.99 c
4.89/4.99 c # maximal fraction of diving LP iterations compared to node LP iterations
4.89/4.99 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.89/4.99 c heuristics/guideddiving/maxlpiterquot = 0.075
4.89/4.99 c
4.89/4.99 c # additional number of allowed LP iterations
4.89/4.99 c # [type: int, range: [0,2147483647], default: 1000]
4.89/4.99 c heuristics/guideddiving/maxlpiterofs = 1500
4.89/4.99 c
4.89/4.99 c # maximal fraction of diving LP iterations compared to node LP iterations
4.89/4.99 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.89/4.99 c heuristics/intdiving/maxlpiterquot = 0.075
4.89/4.99 c
4.89/4.99 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: 10]
4.89/4.99 c heuristics/intshifting/freq = -1
4.89/4.99 c
4.89/4.99 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: 10]
4.89/4.99 c heuristics/linesearchdiving/freq = -1
4.89/4.99 c
4.89/4.99 c # maximal fraction of diving LP iterations compared to node LP iterations
4.89/4.99 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.89/4.99 c heuristics/linesearchdiving/maxlpiterquot = 0.075
4.89/4.99 c
4.89/4.99 c # additional number of allowed LP iterations
4.89/4.99 c # [type: int, range: [0,2147483647], default: 1000]
4.89/4.99 c heuristics/linesearchdiving/maxlpiterofs = 1500
4.89/4.99 c
4.89/4.99 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: 1]
4.89/4.99 c heuristics/nlp/freq = -1
4.89/4.99 c
4.89/4.99 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: 20]
4.89/4.99 c heuristics/objpscostdiving/freq = -1
4.89/4.99 c
4.89/4.99 c # maximal fraction of diving LP iterations compared to total iteration number
4.89/4.99 c # [type: real, range: [0,1], default: 0.01]
4.89/4.99 c heuristics/objpscostdiving/maxlpiterquot = 0.015
4.89/4.99 c
4.89/4.99 c # additional number of allowed LP iterations
4.89/4.99 c # [type: int, range: [0,2147483647], default: 1000]
4.89/4.99 c heuristics/objpscostdiving/maxlpiterofs = 1500
4.89/4.99 c
4.89/4.99 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: 1]
4.89/4.99 c heuristics/oneopt/freq = -1
4.89/4.99 c
4.89/4.99 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: 10]
4.89/4.99 c heuristics/pscostdiving/freq = -1
4.89/4.99 c
4.89/4.99 c # maximal fraction of diving LP iterations compared to node LP iterations
4.89/4.99 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.89/4.99 c heuristics/pscostdiving/maxlpiterquot = 0.075
4.89/4.99 c
4.89/4.99 c # additional number of allowed LP iterations
4.89/4.99 c # [type: int, range: [0,2147483647], default: 1000]
4.89/4.99 c heuristics/pscostdiving/maxlpiterofs = 1500
4.89/4.99 c
4.89/4.99 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: 0]
4.89/4.99 c heuristics/rens/freq = -1
4.89/4.99 c
4.89/4.99 c # minimum percentage of integer variables that have to be fixable
4.89/4.99 c # [type: real, range: [0,1], default: 0.5]
4.89/4.99 c heuristics/rens/minfixingrate = 0.3
4.89/4.99 c
4.89/4.99 c # number of nodes added to the contingent of the total nodes
4.89/4.99 c # [type: longint, range: [0,9223372036854775807], default: 500]
4.89/4.99 c heuristics/rens/nodesofs = 2000
4.89/4.99 c
4.89/4.99 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: 20]
4.89/4.99 c heuristics/rootsoldiving/freq = -1
4.89/4.99 c
4.89/4.99 c # maximal fraction of diving LP iterations compared to node LP iterations
4.89/4.99 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
4.89/4.99 c heuristics/rootsoldiving/maxlpiterquot = 0.015
4.89/4.99 c
4.89/4.99 c # additional number of allowed LP iterations
4.89/4.99 c # [type: int, range: [0,2147483647], default: 1000]
4.89/4.99 c heuristics/rootsoldiving/maxlpiterofs = 1500
4.89/4.99 c
4.89/4.99 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: 1]
4.89/4.99 c heuristics/rounding/freq = -1
4.89/4.99 c
4.89/4.99 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: 10]
4.89/4.99 c heuristics/shifting/freq = -1
4.89/4.99 c
4.89/4.99 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: 1]
4.89/4.99 c heuristics/simplerounding/freq = -1
4.89/4.99 c
4.89/4.99 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: 0]
4.89/4.99 c heuristics/trivial/freq = -1
4.89/4.99 c
4.89/4.99 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: 1]
4.89/4.99 c heuristics/trysol/freq = -1
4.89/4.99 c
4.89/4.99 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: 10]
4.89/4.99 c heuristics/veclendiving/freq = -1
4.89/4.99 c
4.89/4.99 c # maximal fraction of diving LP iterations compared to node LP iterations
4.89/4.99 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.89/4.99 c heuristics/veclendiving/maxlpiterquot = 0.075
4.89/4.99 c
4.89/4.99 c # additional number of allowed LP iterations
4.89/4.99 c # [type: int, range: [0,2147483647], default: 1000]
4.89/4.99 c heuristics/veclendiving/maxlpiterofs = 1500
4.89/4.99 c
4.89/4.99 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: 1]
4.89/4.99 c heuristics/zirounding/freq = -1
4.89/4.99 c
4.89/4.99 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: 0]
4.89/4.99 c separating/cmir/freq = -1
4.89/4.99 c
4.89/4.99 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: 0]
4.89/4.99 c separating/flowcover/freq = -1
4.89/4.99 c
4.89/4.99 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
4.89/4.99 c # [type: int, range: [-1,2147483647], default: -1]
4.89/4.99 c separating/rapidlearning/freq = 0
4.89/4.99 c
4.89/4.99 c -----------------------------------------------------------------------------------------------
4.89/4.99 c start solving
4.99/5.02 c
5.09/5.10 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
5.09/5.10 c 3.3s| 1 | 2 | 0 | - | 163M| 0 | - | 24k| 74k| 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
228.72/228.82 c
228.72/228.82 c SCIP Status : problem is solved [infeasible]
228.72/228.82 c Solving Time (sec) : 225.63
228.72/228.82 c Solving Nodes : 6219
228.72/228.82 c Primal Bound : +1.00000000000000e+20 (0 solutions)
228.72/228.82 c Dual Bound : +1.00000000000000e+20
228.72/228.82 c Gap : 0.00 %
228.72/228.82 s UNSATISFIABLE
228.72/228.82 c SCIP Status : problem is solved [infeasible]
228.72/228.82 c Solving Time : 225.63
228.72/228.82 c Original Problem :
228.72/228.82 c Problem name : HOME/instance-2664545-1276332818.opb
228.72/228.82 c Variables : 25800 (25800 binary, 0 integer, 0 implicit integer, 0 continuous)
228.72/228.82 c Constraints : 76699 initial, 76699 maximal
228.72/228.82 c Presolved Problem :
228.72/228.82 c Problem name : t_HOME/instance-2664545-1276332818.opb
228.72/228.82 c Variables : 24820 (24820 binary, 0 integer, 0 implicit integer, 0 continuous)
228.72/228.82 c Constraints : 74219 initial, 75464 maximal
228.72/228.82 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
228.72/228.82 c trivial : 0.04 38 0 0 0 0 0 0 0
228.72/228.82 c dualfix : 0.01 0 0 0 0 0 0 0 0
228.72/228.82 c boundshift : 0.00 0 0 0 0 0 0 0 0
228.72/228.82 c inttobinary : 0.00 0 0 0 0 0 0 0 0
228.72/228.82 c implics : 0.27 0 468 0 0 0 0 0 0
228.72/228.82 c probing : 0.00 0 0 0 0 0 0 0 0
228.72/228.82 c knapsack : 0.01 0 0 0 0 0 0 0 0
228.72/228.82 c linear : 2.14 473 1 0 473 0 2480 190 598
228.72/228.82 c logicor : 0.26 0 0 0 0 0 0 0 0
228.72/228.82 c root node : - 410 - - 410 - - - -
228.72/228.82 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
228.72/228.82 c integral : 0 0 0 0 0 0 0 0 0 0
228.72/228.82 c knapsack : 380 0 147200 0 4709 519 196581 0 0 0
228.72/228.82 c logicor : 73839+ 0 140957 0 4709 2169 5972453 0 0 0
228.72/228.82 c countsols : 0 0 0 0 4651 0 0 0 0 0
228.72/228.82 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
228.72/228.82 c integral : 0.00 0.00 0.00 0.00 0.00
228.72/228.82 c knapsack : 5.19 0.00 5.16 0.00 0.03
228.72/228.82 c logicor : 111.97 0.00 53.04 0.00 58.93
228.72/228.82 c countsols : 0.01 0.00 0.00 0.00 0.01
228.72/228.82 c Propagators : Time Calls Cutoffs DomReds
228.72/228.82 c vbounds : 0.12 1 0 0
228.72/228.82 c rootredcost : 0.03 0 0 0
228.72/228.82 c pseudoobj : 0.08 0 0 0
228.72/228.82 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
228.72/228.82 c propagation : 5.22 2688 2684 18315 52.3 299 19.8 -
228.72/228.82 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
228.72/228.82 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
228.72/228.82 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
228.72/228.82 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
228.72/228.82 c applied globally : - - - 6961 33.7 - - -
228.72/228.82 c applied locally : - - - 0 0.0 - - -
228.72/228.82 c Separators : Time Calls Cutoffs DomReds Cuts Conss
228.72/228.82 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
228.72/228.82 c redcost : 0.00 0 0 0 0 0
228.72/228.82 c impliedbounds : 0.00 0 0 0 0 0
228.72/228.82 c intobj : 0.00 0 0 0 0 0
228.72/228.82 c cgmip : 0.00 0 0 0 0 0
228.72/228.82 c gomory : 0.00 0 0 0 0 0
228.72/228.82 c strongcg : 0.00 0 0 0 0 0
228.72/228.82 c cmir : 0.00 0 0 0 0 0
228.72/228.82 c flowcover : 0.00 0 0 0 0 0
228.72/228.82 c clique : 0.00 0 0 0 0 0
228.72/228.82 c zerohalf : 0.00 0 0 0 0 0
228.72/228.82 c mcf : 0.00 0 0 0 0 0
228.72/228.82 c rapidlearning : 0.00 0 0 0 0 0
228.72/228.82 c Pricers : Time Calls Vars
228.72/228.82 c problem variables: 0.00 0 0
228.72/228.82 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
228.72/228.82 c relpscost : 0.00 0 0 0 0 0 0
228.72/228.82 c pscost : 0.00 0 0 0 0 0 0
228.72/228.82 c inference : 15.46 4651 0 0 0 0 9302
228.72/228.82 c mostinf : 0.00 0 0 0 0 0 0
228.72/228.82 c leastinf : 0.00 0 0 0 0 0 0
228.72/228.82 c fullstrong : 0.00 0 0 0 0 0 0
228.72/228.82 c allfullstrong : 0.00 0 0 0 0 0 0
228.72/228.82 c random : 0.00 0 0 0 0 0 0
228.72/228.82 c Primal Heuristics : Time Calls Found
228.72/228.82 c LP solutions : 0.00 - 0
228.72/228.82 c pseudo solutions : 0.00 - 0
228.72/228.82 c trivial : 0.04 1 0
228.72/228.82 c simplerounding : 0.00 0 0
228.72/228.82 c zirounding : 0.00 0 0
228.72/228.82 c rounding : 0.00 0 0
228.72/228.82 c shifting : 0.00 0 0
228.72/228.82 c intshifting : 0.00 0 0
228.72/228.82 c oneopt : 0.00 0 0
228.72/228.82 c twoopt : 0.00 0 0
228.72/228.82 c fixandinfer : 0.00 0 0
228.72/228.82 c feaspump : 0.00 0 0
228.72/228.82 c coefdiving : 0.00 0 0
228.72/228.82 c pscostdiving : 0.00 0 0
228.72/228.82 c fracdiving : 0.00 0 0
228.72/228.82 c veclendiving : 0.00 0 0
228.72/228.82 c intdiving : 0.00 0 0
228.72/228.82 c actconsdiving : 0.00 0 0
228.72/228.82 c objpscostdiving : 0.00 0 0
228.72/228.82 c rootsoldiving : 0.00 0 0
228.72/228.82 c linesearchdiving : 0.00 0 0
228.72/228.82 c guideddiving : 0.00 0 0
228.72/228.82 c octane : 0.00 0 0
228.72/228.82 c rens : 0.00 0 0
228.72/228.82 c rins : 0.00 0 0
228.72/228.82 c localbranching : 0.00 0 0
228.72/228.82 c mutation : 0.00 0 0
228.72/228.82 c crossover : 0.00 0 0
228.72/228.82 c dins : 0.00 0 0
228.72/228.82 c undercover : 0.00 0 0
228.72/228.82 c nlp : 0.00 0 0
228.72/228.82 c trysol : 0.00 0 0
228.72/228.82 c LP : Time Calls Iterations Iter/call Iter/sec
228.72/228.82 c primal LP : 0.00 0 0 0.00 -
228.72/228.82 c dual LP : 0.00 0 0 0.00 -
228.72/228.82 c lex dual LP : 0.00 0 0 0.00 -
228.72/228.82 c barrier LP : 0.00 0 0 0.00 -
228.72/228.82 c diving/probing LP: 0.00 0 0 0.00 -
228.72/228.82 c strong branching : 0.00 0 0 0.00 -
228.72/228.82 c (at root node) : - 0 0 0.00 -
228.72/228.82 c conflict analysis: 0.00 0 0 0.00 -
228.72/228.82 c B&B Tree :
228.72/228.82 c number of runs : 1
228.72/228.82 c nodes : 6219
228.72/228.82 c nodes (total) : 6219
228.72/228.82 c nodes left : 0
228.72/228.82 c max depth : 95
228.72/228.82 c max depth (total): 95
228.72/228.82 c backtracks : 1553 (25.0%)
228.72/228.82 c delayed cutoffs : 3084
228.72/228.82 c repropagations : 6864 (2226070 domain reductions, 1120 cutoffs)
228.72/228.82 c avg switch length: 7.52
228.72/228.82 c switching time : 77.63
228.72/228.82 c Solution :
228.72/228.82 c Solutions found : 0 (0 improvements)
228.72/228.82 c Primal Bound : infeasible
228.72/228.82 c Dual Bound : -
228.72/228.82 c Gap : 0.00 %
228.72/228.82 c Root Dual Bound : +0.00000000000000e+00
228.72/228.82 c Root Iterations : 0
229.01/229.17 c Time complete: 229.09.