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-2664551-1276333524.opb>
0.49/0.57 c original problem has 11476 variables (11476 bin, 0 int, 0 impl, 0 cont) and 33090 constraints
0.49/0.57 c problem read
0.49/0.57 c No objective function, only one solution is needed.
0.49/0.58 c presolving settings loaded
0.49/0.58 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.69/0.75 c presolving:
1.40/1.45 c (round 1) 935 del vars, 767 del conss, 276 chg bounds, 354 chg sides, 810 chg coeffs, 0 upgd conss, 643966 impls, 0 clqs
1.49/1.53 c (round 2) 968 del vars, 2335 del conss, 295 chg bounds, 354 chg sides, 810 chg coeffs, 0 upgd conss, 644092 impls, 0 clqs
1.49/1.56 c (round 3) 988 del vars, 2375 del conss, 303 chg bounds, 354 chg sides, 810 chg coeffs, 0 upgd conss, 644408 impls, 0 clqs
1.59/1.60 c (round 4) 989 del vars, 2405 del conss, 303 chg bounds, 354 chg sides, 810 chg coeffs, 0 upgd conss, 644500 impls, 0 clqs
1.79/1.88 c (round 5) 989 del vars, 2422 del conss, 303 chg bounds, 354 chg sides, 810 chg coeffs, 30668 upgd conss, 644500 impls, 0 clqs
1.89/1.99 c presolving (6 rounds):
1.89/1.99 c 989 deleted vars, 2422 deleted constraints, 303 tightened bounds, 0 added holes, 354 changed sides, 810 changed coefficients
1.89/1.99 c 644500 implications, 0 cliques
1.89/1.99 c presolved problem has 10487 variables (10487 bin, 0 int, 0 impl, 0 cont) and 30668 constraints
1.89/1.99 c 708 constraints of type <knapsack>
1.89/1.99 c 29960 constraints of type <logicor>
1.89/1.99 c transformed objective value is always integral (scale: 1)
1.89/1.99 c Presolving Time: 1.12
1.89/1.99 c - non default parameters ----------------------------------------------------------------------
1.89/1.99 c # SCIP version 1.2.1.2
1.89/1.99 c
1.89/1.99 c # frequency for displaying node information lines
1.89/1.99 c # [type: int, range: [-1,2147483647], default: 100]
1.89/1.99 c display/freq = 10000
1.89/1.99 c
1.89/1.99 c # maximal time in seconds to run
1.89/1.99 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.89/1.99 c limits/time = 1799.43
1.89/1.99 c
1.89/1.99 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.89/1.99 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.89/1.99 c limits/memory = 1620
1.89/1.99 c
1.89/1.99 c # solving stops, if the given number of solutions were found (-1: no limit)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: -1]
1.89/1.99 c limits/solutions = 1
1.89/1.99 c
1.89/1.99 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.99 c lp/solvefreq = -1
1.89/1.99 c
1.89/1.99 c # maximal number of separation rounds per node (-1: unlimited)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: 5]
1.89/1.99 c separating/maxrounds = 1
1.89/1.99 c
1.89/1.99 c # maximal number of separation rounds in the root node (-1: unlimited)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: -1]
1.89/1.99 c separating/maxroundsroot = 5
1.89/1.99 c
1.89/1.99 c # should presolving try to simplify inequalities
1.89/1.99 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.89/1.99 c constraints/linear/simplifyinequalities = TRUE
1.89/1.99 c
1.89/1.99 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.89/1.99 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.89/1.99 c constraints/knapsack/disaggregation = FALSE
1.89/1.99 c
1.89/1.99 c # should presolving try to simplify knapsacks
1.89/1.99 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.89/1.99 c constraints/knapsack/simplifyinequalities = TRUE
1.89/1.99 c
1.89/1.99 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: -1]
1.89/1.99 c presolving/probing/maxrounds = 0
1.89/1.99 c
1.89/1.99 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.99 c heuristics/coefdiving/freq = -1
1.89/1.99 c
1.89/1.99 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.99 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.99 c heuristics/coefdiving/maxlpiterquot = 0.075
1.89/1.99 c
1.89/1.99 c # additional number of allowed LP iterations
1.89/1.99 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.99 c heuristics/coefdiving/maxlpiterofs = 1500
1.89/1.99 c
1.89/1.99 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: 30]
1.89/1.99 c heuristics/crossover/freq = -1
1.89/1.99 c
1.89/1.99 c # number of nodes added to the contingent of the total nodes
1.89/1.99 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.89/1.99 c heuristics/crossover/nodesofs = 750
1.89/1.99 c
1.89/1.99 c # number of nodes without incumbent change that heuristic should wait
1.89/1.99 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.89/1.99 c heuristics/crossover/nwaitingnodes = 100
1.89/1.99 c
1.89/1.99 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.89/1.99 c # [type: real, range: [0,1], default: 0.1]
1.89/1.99 c heuristics/crossover/nodesquot = 0.15
1.89/1.99 c
1.89/1.99 c # minimum percentage of integer variables that have to be fixed
1.89/1.99 c # [type: real, range: [0,1], default: 0.666]
1.89/1.99 c heuristics/crossover/minfixingrate = 0.5
1.89/1.99 c
1.89/1.99 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: 20]
1.89/1.99 c heuristics/feaspump/freq = -1
1.89/1.99 c
1.89/1.99 c # additional number of allowed LP iterations
1.89/1.99 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.99 c heuristics/feaspump/maxlpiterofs = 2000
1.89/1.99 c
1.89/1.99 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.99 c heuristics/fracdiving/freq = -1
1.89/1.99 c
1.89/1.99 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.99 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.99 c heuristics/fracdiving/maxlpiterquot = 0.075
1.89/1.99 c
1.89/1.99 c # additional number of allowed LP iterations
1.89/1.99 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.99 c heuristics/fracdiving/maxlpiterofs = 1500
1.89/1.99 c
1.89/1.99 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.99 c heuristics/guideddiving/freq = -1
1.89/1.99 c
1.89/1.99 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.99 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.99 c heuristics/guideddiving/maxlpiterquot = 0.075
1.89/1.99 c
1.89/1.99 c # additional number of allowed LP iterations
1.89/1.99 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.99 c heuristics/guideddiving/maxlpiterofs = 1500
1.89/1.99 c
1.89/1.99 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.99 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.99 c heuristics/intdiving/maxlpiterquot = 0.075
1.89/1.99 c
1.89/1.99 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.99 c heuristics/intshifting/freq = -1
1.89/1.99 c
1.89/1.99 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.99 c heuristics/linesearchdiving/freq = -1
1.89/1.99 c
1.89/1.99 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.99 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.99 c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.89/1.99 c
1.89/1.99 c # additional number of allowed LP iterations
1.89/1.99 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.99 c heuristics/linesearchdiving/maxlpiterofs = 1500
1.89/1.99 c
1.89/1.99 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.99 c heuristics/nlp/freq = -1
1.89/1.99 c
1.89/1.99 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: 20]
1.89/1.99 c heuristics/objpscostdiving/freq = -1
1.89/1.99 c
1.89/1.99 c # maximal fraction of diving LP iterations compared to total iteration number
1.89/1.99 c # [type: real, range: [0,1], default: 0.01]
1.89/1.99 c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.89/1.99 c
1.89/1.99 c # additional number of allowed LP iterations
1.89/1.99 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.99 c heuristics/objpscostdiving/maxlpiterofs = 1500
1.89/1.99 c
1.89/1.99 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.99 c heuristics/oneopt/freq = -1
1.89/1.99 c
1.89/1.99 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.99 c heuristics/pscostdiving/freq = -1
1.89/1.99 c
1.89/1.99 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.99 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.99 c heuristics/pscostdiving/maxlpiterquot = 0.075
1.89/1.99 c
1.89/1.99 c # additional number of allowed LP iterations
1.89/1.99 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.99 c heuristics/pscostdiving/maxlpiterofs = 1500
1.89/1.99 c
1.89/1.99 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: 0]
1.89/1.99 c heuristics/rens/freq = -1
1.89/1.99 c
1.89/1.99 c # minimum percentage of integer variables that have to be fixable
1.89/1.99 c # [type: real, range: [0,1], default: 0.5]
1.89/1.99 c heuristics/rens/minfixingrate = 0.3
1.89/1.99 c
1.89/1.99 c # number of nodes added to the contingent of the total nodes
1.89/1.99 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.89/1.99 c heuristics/rens/nodesofs = 2000
1.89/1.99 c
1.89/1.99 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: 20]
1.89/1.99 c heuristics/rootsoldiving/freq = -1
1.89/1.99 c
1.89/1.99 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.99 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.89/1.99 c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.89/1.99 c
1.89/1.99 c # additional number of allowed LP iterations
1.89/1.99 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.99 c heuristics/rootsoldiving/maxlpiterofs = 1500
1.89/1.99 c
1.89/1.99 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.99 c heuristics/rounding/freq = -1
1.89/1.99 c
1.89/1.99 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.99 c heuristics/shifting/freq = -1
1.89/1.99 c
1.89/1.99 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.99 c heuristics/simplerounding/freq = -1
1.89/1.99 c
1.89/1.99 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: 0]
1.89/1.99 c heuristics/trivial/freq = -1
1.89/1.99 c
1.89/1.99 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.99 c heuristics/trysol/freq = -1
1.89/1.99 c
1.89/1.99 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: 10]
1.89/1.99 c heuristics/veclendiving/freq = -1
1.89/1.99 c
1.89/1.99 c # maximal fraction of diving LP iterations compared to node LP iterations
1.89/1.99 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.89/1.99 c heuristics/veclendiving/maxlpiterquot = 0.075
1.89/1.99 c
1.89/1.99 c # additional number of allowed LP iterations
1.89/1.99 c # [type: int, range: [0,2147483647], default: 1000]
1.89/1.99 c heuristics/veclendiving/maxlpiterofs = 1500
1.89/1.99 c
1.89/1.99 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: 1]
1.89/1.99 c heuristics/zirounding/freq = -1
1.89/1.99 c
1.89/1.99 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: 0]
1.89/1.99 c separating/cmir/freq = -1
1.89/1.99 c
1.89/1.99 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: 0]
1.89/1.99 c separating/flowcover/freq = -1
1.89/1.99 c
1.89/1.99 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.89/1.99 c # [type: int, range: [-1,2147483647], default: -1]
1.89/1.99 c separating/rapidlearning/freq = 0
1.89/1.99 c
1.89/1.99 c -----------------------------------------------------------------------------------------------
1.89/1.99 c start solving
1.99/2.00 c
1.99/2.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.99/2.05 c 1.2s| 1 | 2 | 0 | - | 62M| 0 | - | 10k| 30k| 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
147.74/147.83 c 145s| 10000 | 2637 | 0 | 0.0 | 136M| 115 | - | 10k| 32k| 0 | 0 | 0 | 13k| 0 | 0.000000e+00 | -- | Inf
312.30/312.49 c 308s| 20000 | 2682 | 0 | 0.0 | 151M| 115 | - | 10k| 35k| 0 | 0 | 0 | 29k| 0 | 0.000000e+00 | -- | Inf
382.37/382.51 c
382.37/382.51 c SCIP Status : problem is solved [infeasible]
382.37/382.51 c Solving Time (sec) : 377.15
382.37/382.51 c Solving Nodes : 23060
382.37/382.51 c Primal Bound : +1.00000000000000e+20 (0 solutions)
382.37/382.51 c Dual Bound : +1.00000000000000e+20
382.37/382.51 c Gap : 0.00 %
382.37/382.51 s UNSATISFIABLE
382.37/382.51 c SCIP Status : problem is solved [infeasible]
382.37/382.51 c Solving Time : 377.15
382.37/382.51 c Original Problem :
382.37/382.51 c Problem name : HOME/instance-2664551-1276333524.opb
382.37/382.51 c Variables : 11476 (11476 binary, 0 integer, 0 implicit integer, 0 continuous)
382.37/382.51 c Constraints : 33090 initial, 33090 maximal
382.37/382.51 c Presolved Problem :
382.37/382.51 c Problem name : t_HOME/instance-2664551-1276333524.opb
382.37/382.51 c Variables : 10487 (10487 binary, 0 integer, 0 implicit integer, 0 continuous)
382.37/382.51 c Constraints : 30668 initial, 36010 maximal
382.37/382.51 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
382.37/382.51 c trivial : 0.00 12 0 0 0 0 0 0 0
382.37/382.51 c dualfix : 0.01 0 0 0 0 0 0 0 0
382.37/382.51 c boundshift : 0.00 0 0 0 0 0 0 0 0
382.37/382.51 c inttobinary : 0.00 0 0 0 0 0 0 0 0
382.37/382.51 c implics : 0.16 0 670 0 0 0 0 0 0
382.37/382.51 c probing : 0.00 0 0 0 0 0 0 0 0
382.37/382.51 c knapsack : 0.01 0 0 0 0 0 0 0 0
382.37/382.51 c linear : 0.76 303 4 0 303 0 2422 354 810
382.37/382.51 c logicor : 0.07 0 0 0 0 0 0 0 0
382.37/382.51 c root node : - 847 - - 847 - - - -
382.37/382.51 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
382.37/382.51 c integral : 0 0 0 0 0 0 0 0 0 0
382.37/382.51 c knapsack : 708 0 637753 0 17708 290 11087 0 0 0
382.37/382.51 c logicor : 29960+ 0 629687 0 17708 9633 8818918 0 0 0
382.37/382.51 c countsols : 0 0 0 0 17699 0 0 0 0 0
382.37/382.51 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
382.37/382.51 c integral : 0.00 0.00 0.00 0.00 0.00
382.37/382.51 c knapsack : 13.41 0.00 13.32 0.00 0.09
382.37/382.51 c logicor : 192.86 0.00 89.14 0.00 103.72
382.37/382.51 c countsols : 0.02 0.00 0.00 0.00 0.02
382.37/382.51 c Propagators : Time Calls Cutoffs DomReds
382.37/382.51 c vbounds : 0.31 1 0 0
382.37/382.51 c rootredcost : 0.32 0 0 0
382.37/382.51 c pseudoobj : 0.23 0 0 0
382.37/382.51 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
382.37/382.51 c propagation : 9.88 9923 9917 111225 59.1 1275 23.9 -
382.37/382.51 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
382.37/382.51 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
382.37/382.51 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
382.37/382.52 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
382.37/382.52 c applied globally : - - - 35710 48.5 - - -
382.37/382.52 c applied locally : - - - 0 0.0 - - -
382.37/382.52 c Separators : Time Calls Cutoffs DomReds Cuts Conss
382.37/382.52 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
382.37/382.52 c redcost : 0.00 0 0 0 0 0
382.37/382.52 c impliedbounds : 0.00 0 0 0 0 0
382.37/382.52 c intobj : 0.00 0 0 0 0 0
382.37/382.52 c cgmip : 0.00 0 0 0 0 0
382.37/382.52 c gomory : 0.00 0 0 0 0 0
382.37/382.52 c strongcg : 0.00 0 0 0 0 0
382.37/382.52 c cmir : 0.00 0 0 0 0 0
382.37/382.52 c flowcover : 0.00 0 0 0 0 0
382.37/382.52 c clique : 0.00 0 0 0 0 0
382.37/382.52 c zerohalf : 0.00 0 0 0 0 0
382.37/382.52 c mcf : 0.00 0 0 0 0 0
382.37/382.52 c rapidlearning : 0.00 0 0 0 0 0
382.37/382.52 c Pricers : Time Calls Vars
382.37/382.52 c problem variables: 0.00 0 0
382.37/382.52 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
382.37/382.52 c relpscost : 0.00 0 0 0 0 0 0
382.37/382.52 c pscost : 0.00 0 0 0 0 0 0
382.37/382.52 c inference : 32.15 17699 0 0 0 0 35398
382.37/382.52 c mostinf : 0.00 0 0 0 0 0 0
382.37/382.52 c leastinf : 0.00 0 0 0 0 0 0
382.37/382.52 c fullstrong : 0.00 0 0 0 0 0 0
382.37/382.52 c allfullstrong : 0.00 0 0 0 0 0 0
382.37/382.52 c random : 0.00 0 0 0 0 0 0
382.37/382.52 c Primal Heuristics : Time Calls Found
382.37/382.52 c LP solutions : 0.00 - 0
382.37/382.52 c pseudo solutions : 0.00 - 0
382.37/382.52 c trivial : 0.02 1 0
382.37/382.52 c simplerounding : 0.00 0 0
382.37/382.52 c zirounding : 0.00 0 0
382.37/382.52 c rounding : 0.00 0 0
382.37/382.52 c shifting : 0.00 0 0
382.37/382.52 c intshifting : 0.00 0 0
382.37/382.52 c oneopt : 0.00 0 0
382.37/382.52 c twoopt : 0.00 0 0
382.37/382.52 c fixandinfer : 0.00 0 0
382.37/382.52 c feaspump : 0.00 0 0
382.37/382.52 c coefdiving : 0.00 0 0
382.37/382.52 c pscostdiving : 0.00 0 0
382.37/382.52 c fracdiving : 0.00 0 0
382.37/382.52 c veclendiving : 0.00 0 0
382.37/382.52 c intdiving : 0.00 0 0
382.37/382.52 c actconsdiving : 0.00 0 0
382.37/382.52 c objpscostdiving : 0.00 0 0
382.37/382.52 c rootsoldiving : 0.00 0 0
382.37/382.52 c linesearchdiving : 0.00 0 0
382.37/382.52 c guideddiving : 0.00 0 0
382.37/382.52 c octane : 0.00 0 0
382.37/382.52 c rens : 0.00 0 0
382.37/382.52 c rins : 0.00 0 0
382.37/382.52 c localbranching : 0.00 0 0
382.37/382.52 c mutation : 0.00 0 0
382.37/382.52 c crossover : 0.00 0 0
382.37/382.52 c dins : 0.00 0 0
382.37/382.52 c undercover : 0.00 0 0
382.37/382.52 c nlp : 0.00 0 0
382.37/382.52 c trysol : 0.00 0 0
382.37/382.52 c LP : Time Calls Iterations Iter/call Iter/sec
382.37/382.52 c primal LP : 0.00 0 0 0.00 -
382.37/382.52 c dual LP : 0.00 0 0 0.00 -
382.37/382.52 c lex dual LP : 0.00 0 0 0.00 -
382.37/382.52 c barrier LP : 0.00 0 0 0.00 -
382.37/382.52 c diving/probing LP: 0.00 0 0 0.00 -
382.37/382.52 c strong branching : 0.00 0 0 0.00 -
382.37/382.52 c (at root node) : - 0 0 0.00 -
382.37/382.52 c conflict analysis: 0.00 0 0 0.00 -
382.37/382.52 c B&B Tree :
382.37/382.52 c number of runs : 1
382.37/382.52 c nodes : 23060
382.37/382.52 c nodes (total) : 23060
382.37/382.52 c nodes left : 0
382.37/382.52 c max depth : 115
382.37/382.52 c max depth (total): 115
382.37/382.52 c backtracks : 5565 (24.1%)
382.37/382.52 c delayed cutoffs : 12339
382.37/382.52 c repropagations : 18956 (3087118 domain reductions, 4562 cutoffs)
382.37/382.52 c avg switch length: 6.40
382.37/382.52 c switching time : 116.37
382.37/382.52 c Solution :
382.37/382.52 c Solutions found : 0 (0 improvements)
382.37/382.52 c Primal Bound : infeasible
382.37/382.52 c Dual Bound : -
382.37/382.52 c Gap : 0.00 %
382.37/382.52 c Root Dual Bound : +0.00000000000000e+00
382.37/382.52 c Root Iterations : 0
382.58/382.71 c Time complete: 382.59.