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-2664547-1276333145.opb>
0.29/0.30 c original problem has 6059 variables (6059 bin, 0 int, 0 impl, 0 cont) and 16684 constraints
0.29/0.30 c problem read
0.29/0.30 c No objective function, only one solution is needed.
0.29/0.30 c presolving settings loaded
0.29/0.30 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.39/0.40 c presolving:
0.69/0.72 c (round 1) 1234 del vars, 2261 del conss, 773 chg bounds, 372 chg sides, 878 chg coeffs, 0 upgd conss, 298456 impls, 0 clqs
0.69/0.76 c (round 2) 1262 del vars, 3404 del conss, 795 chg bounds, 373 chg sides, 880 chg coeffs, 0 upgd conss, 298562 impls, 0 clqs
0.69/0.78 c (round 3) 1265 del vars, 3413 del conss, 796 chg bounds, 374 chg sides, 881 chg coeffs, 0 upgd conss, 298654 impls, 0 clqs
0.79/0.80 c (round 4) 1266 del vars, 3420 del conss, 796 chg bounds, 374 chg sides, 881 chg coeffs, 0 upgd conss, 298834 impls, 0 clqs
0.79/0.81 c (round 5) 1266 del vars, 3422 del conss, 796 chg bounds, 374 chg sides, 881 chg coeffs, 0 upgd conss, 298834 impls, 0 clqs
0.89/0.98 c (round 6) 1266 del vars, 3477 del conss, 796 chg bounds, 374 chg sides, 881 chg coeffs, 13207 upgd conss, 298834 impls, 0 clqs
1.00/1.02 c presolving (7 rounds):
1.00/1.02 c 1266 deleted vars, 3477 deleted constraints, 796 tightened bounds, 0 added holes, 374 changed sides, 881 changed coefficients
1.00/1.02 c 298834 implications, 0 cliques
1.00/1.02 c presolved problem has 4793 variables (4793 bin, 0 int, 0 impl, 0 cont) and 13207 constraints
1.00/1.02 c 716 constraints of type <knapsack>
1.00/1.02 c 12491 constraints of type <logicor>
1.00/1.02 c transformed objective value is always integral (scale: 1)
1.00/1.02 c Presolving Time: 0.56
1.00/1.02 c - non default parameters ----------------------------------------------------------------------
1.00/1.02 c # SCIP version 1.2.1.2
1.00/1.02 c
1.00/1.02 c # frequency for displaying node information lines
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 100]
1.00/1.02 c display/freq = 10000
1.00/1.02 c
1.00/1.02 c # maximal time in seconds to run
1.00/1.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.00/1.02 c limits/time = 1799.71
1.00/1.02 c
1.00/1.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.00/1.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.00/1.02 c limits/memory = 1620
1.00/1.02 c
1.00/1.02 c # solving stops, if the given number of solutions were found (-1: no limit)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: -1]
1.00/1.02 c limits/solutions = 1
1.00/1.02 c
1.00/1.02 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.02 c lp/solvefreq = -1
1.00/1.02 c
1.00/1.02 c # maximal number of separation rounds per node (-1: unlimited)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 5]
1.00/1.02 c separating/maxrounds = 1
1.00/1.02 c
1.00/1.02 c # maximal number of separation rounds in the root node (-1: unlimited)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: -1]
1.00/1.02 c separating/maxroundsroot = 5
1.00/1.02 c
1.00/1.02 c # should presolving try to simplify inequalities
1.00/1.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.00/1.02 c constraints/linear/simplifyinequalities = TRUE
1.00/1.02 c
1.00/1.02 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.00/1.02 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.00/1.02 c constraints/knapsack/disaggregation = FALSE
1.00/1.02 c
1.00/1.02 c # should presolving try to simplify knapsacks
1.00/1.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.00/1.02 c constraints/knapsack/simplifyinequalities = TRUE
1.00/1.02 c
1.00/1.02 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: -1]
1.00/1.02 c presolving/probing/maxrounds = 0
1.00/1.02 c
1.00/1.02 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.02 c heuristics/coefdiving/freq = -1
1.00/1.02 c
1.00/1.02 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.02 c heuristics/coefdiving/maxlpiterquot = 0.075
1.00/1.02 c
1.00/1.02 c # additional number of allowed LP iterations
1.00/1.02 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.02 c heuristics/coefdiving/maxlpiterofs = 1500
1.00/1.02 c
1.00/1.02 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 30]
1.00/1.02 c heuristics/crossover/freq = -1
1.00/1.02 c
1.00/1.02 c # number of nodes added to the contingent of the total nodes
1.00/1.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.00/1.02 c heuristics/crossover/nodesofs = 750
1.00/1.02 c
1.00/1.02 c # number of nodes without incumbent change that heuristic should wait
1.00/1.02 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.00/1.02 c heuristics/crossover/nwaitingnodes = 100
1.00/1.02 c
1.00/1.02 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.00/1.02 c # [type: real, range: [0,1], default: 0.1]
1.00/1.02 c heuristics/crossover/nodesquot = 0.15
1.00/1.02 c
1.00/1.02 c # minimum percentage of integer variables that have to be fixed
1.00/1.02 c # [type: real, range: [0,1], default: 0.666]
1.00/1.02 c heuristics/crossover/minfixingrate = 0.5
1.00/1.02 c
1.00/1.02 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 20]
1.00/1.02 c heuristics/feaspump/freq = -1
1.00/1.02 c
1.00/1.02 c # additional number of allowed LP iterations
1.00/1.02 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.02 c heuristics/feaspump/maxlpiterofs = 2000
1.00/1.02 c
1.00/1.02 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.02 c heuristics/fracdiving/freq = -1
1.00/1.02 c
1.00/1.02 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.02 c heuristics/fracdiving/maxlpiterquot = 0.075
1.00/1.02 c
1.00/1.02 c # additional number of allowed LP iterations
1.00/1.02 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.02 c heuristics/fracdiving/maxlpiterofs = 1500
1.00/1.02 c
1.00/1.02 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.00/1.02 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.02 c heuristics/guideddiving/freq = -1
1.00/1.02 c
1.00/1.02 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.02 c heuristics/guideddiving/maxlpiterquot = 0.075
1.00/1.02 c
1.00/1.02 c # additional number of allowed LP iterations
1.00/1.02 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.02 c heuristics/guideddiving/maxlpiterofs = 1500
1.00/1.02 c
1.00/1.02 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.02 c heuristics/intdiving/maxlpiterquot = 0.075
1.00/1.02 c
1.00/1.02 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.00/1.03 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.03 c heuristics/intshifting/freq = -1
1.00/1.03 c
1.00/1.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.00/1.03 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.03 c heuristics/linesearchdiving/freq = -1
1.00/1.03 c
1.00/1.03 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.00/1.03 c
1.00/1.03 c # additional number of allowed LP iterations
1.00/1.03 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
1.00/1.03 c
1.00/1.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
1.00/1.03 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.03 c heuristics/nlp/freq = -1
1.00/1.03 c
1.00/1.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.00/1.03 c # [type: int, range: [-1,2147483647], default: 20]
1.00/1.03 c heuristics/objpscostdiving/freq = -1
1.00/1.03 c
1.00/1.03 c # maximal fraction of diving LP iterations compared to total iteration number
1.00/1.03 c # [type: real, range: [0,1], default: 0.01]
1.00/1.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.00/1.03 c
1.00/1.03 c # additional number of allowed LP iterations
1.00/1.03 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
1.00/1.03 c
1.00/1.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.00/1.03 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.03 c heuristics/oneopt/freq = -1
1.00/1.03 c
1.00/1.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.00/1.03 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.03 c heuristics/pscostdiving/freq = -1
1.00/1.03 c
1.00/1.03 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
1.00/1.03 c
1.00/1.03 c # additional number of allowed LP iterations
1.00/1.03 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.03 c heuristics/pscostdiving/maxlpiterofs = 1500
1.00/1.03 c
1.00/1.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.00/1.03 c # [type: int, range: [-1,2147483647], default: 0]
1.00/1.03 c heuristics/rens/freq = -1
1.00/1.03 c
1.00/1.03 c # minimum percentage of integer variables that have to be fixable
1.00/1.03 c # [type: real, range: [0,1], default: 0.5]
1.00/1.03 c heuristics/rens/minfixingrate = 0.3
1.00/1.03 c
1.00/1.03 c # number of nodes added to the contingent of the total nodes
1.00/1.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.00/1.03 c heuristics/rens/nodesofs = 2000
1.00/1.03 c
1.00/1.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.00/1.03 c # [type: int, range: [-1,2147483647], default: 20]
1.00/1.03 c heuristics/rootsoldiving/freq = -1
1.00/1.03 c
1.00/1.03 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.00/1.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.00/1.03 c
1.00/1.03 c # additional number of allowed LP iterations
1.00/1.03 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.03 c heuristics/rootsoldiving/maxlpiterofs = 1500
1.00/1.03 c
1.00/1.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.00/1.03 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.03 c heuristics/rounding/freq = -1
1.00/1.03 c
1.00/1.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.00/1.03 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.03 c heuristics/shifting/freq = -1
1.00/1.03 c
1.00/1.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.00/1.03 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.03 c heuristics/simplerounding/freq = -1
1.00/1.03 c
1.00/1.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.00/1.03 c # [type: int, range: [-1,2147483647], default: 0]
1.00/1.03 c heuristics/trivial/freq = -1
1.00/1.03 c
1.00/1.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.00/1.03 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.03 c heuristics/trysol/freq = -1
1.00/1.03 c
1.00/1.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.00/1.03 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.03 c heuristics/veclendiving/freq = -1
1.00/1.03 c
1.00/1.03 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.03 c heuristics/veclendiving/maxlpiterquot = 0.075
1.00/1.03 c
1.00/1.03 c # additional number of allowed LP iterations
1.00/1.03 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.03 c heuristics/veclendiving/maxlpiterofs = 1500
1.00/1.03 c
1.00/1.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.00/1.03 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.03 c heuristics/zirounding/freq = -1
1.00/1.03 c
1.00/1.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.00/1.03 c # [type: int, range: [-1,2147483647], default: 0]
1.00/1.03 c separating/cmir/freq = -1
1.00/1.03 c
1.00/1.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.00/1.03 c # [type: int, range: [-1,2147483647], default: 0]
1.00/1.03 c separating/flowcover/freq = -1
1.00/1.03 c
1.00/1.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.00/1.03 c # [type: int, range: [-1,2147483647], default: -1]
1.00/1.03 c separating/rapidlearning/freq = 0
1.00/1.03 c
1.00/1.03 c -----------------------------------------------------------------------------------------------
1.00/1.03 c start solving
1.00/1.03 c
1.00/1.05 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.00/1.05 c 0.6s| 1 | 2 | 0 | - | 30M| 0 | - |4793 | 13k| 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
3.29/3.35 c
3.29/3.35 c SCIP Status : problem is solved [infeasible]
3.29/3.35 c Solving Time (sec) : 2.90
3.29/3.35 c Solving Nodes : 440
3.29/3.35 c Primal Bound : +1.00000000000000e+20 (0 solutions)
3.29/3.35 c Dual Bound : +1.00000000000000e+20
3.29/3.35 c Gap : 0.00 %
3.29/3.35 s UNSATISFIABLE
3.29/3.35 c SCIP Status : problem is solved [infeasible]
3.29/3.35 c Solving Time : 2.90
3.29/3.35 c Original Problem :
3.29/3.35 c Problem name : HOME/instance-2664547-1276333145.opb
3.29/3.35 c Variables : 6059 (6059 binary, 0 integer, 0 implicit integer, 0 continuous)
3.29/3.35 c Constraints : 16684 initial, 16684 maximal
3.29/3.35 c Presolved Problem :
3.29/3.35 c Problem name : t_HOME/instance-2664547-1276333145.opb
3.29/3.35 c Variables : 4793 (4793 binary, 0 integer, 0 implicit integer, 0 continuous)
3.29/3.35 c Constraints : 13207 initial, 13297 maximal
3.29/3.35 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.29/3.35 c trivial : 0.00 3 0 0 0 0 0 0 0
3.29/3.35 c dualfix : 0.00 1 0 0 0 0 0 0 0
3.29/3.35 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.29/3.35 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.29/3.35 c implics : 0.05 0 456 0 0 0 0 0 0
3.29/3.35 c probing : 0.00 0 0 0 0 0 0 0 0
3.29/3.35 c knapsack : 0.01 0 0 0 0 0 0 0 0
3.29/3.35 c linear : 0.39 796 10 0 796 0 3477 374 881
3.29/3.35 c logicor : 0.07 0 0 0 0 0 0 0 0
3.29/3.35 c root node : - 3215 - - 3215 - - - -
3.29/3.35 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.29/3.35 c integral : 0 0 0 0 0 0 0 0 0 0
3.29/3.35 c knapsack : 716 0 3816 0 402 0 238 0 0 0
3.29/3.35 c logicor : 12491+ 0 3409 0 402 66 49786 0 0 0
3.29/3.35 c countsols : 0 0 0 0 402 0 0 0 0 0
3.29/3.35 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.29/3.35 c integral : 0.00 0.00 0.00 0.00 0.00
3.29/3.35 c knapsack : 0.11 0.00 0.11 0.00 0.00
3.29/3.35 c logicor : 1.46 0.00 0.36 0.00 1.10
3.29/3.35 c countsols : 0.00 0.00 0.00 0.00 0.00
3.29/3.35 c Propagators : Time Calls Cutoffs DomReds
3.29/3.35 c vbounds : 0.00 1 0 0
3.29/3.35 c rootredcost : 0.00 0 0 0
3.29/3.35 c pseudoobj : 0.00 0 0 0
3.29/3.35 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.29/3.35 c propagation : 0.01 66 62 182 11.1 9 10.3 -
3.29/3.35 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.29/3.35 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.29/3.35 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.29/3.35 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.29/3.35 c applied globally : - - - 120 7.6 - - -
3.29/3.35 c applied locally : - - - 0 0.0 - - -
3.29/3.35 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.29/3.35 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
3.29/3.35 c redcost : 0.00 0 0 0 0 0
3.29/3.35 c impliedbounds : 0.00 0 0 0 0 0
3.29/3.35 c intobj : 0.00 0 0 0 0 0
3.29/3.35 c cgmip : 0.00 0 0 0 0 0
3.29/3.35 c gomory : 0.00 0 0 0 0 0
3.29/3.35 c strongcg : 0.00 0 0 0 0 0
3.29/3.35 c cmir : 0.00 0 0 0 0 0
3.29/3.35 c flowcover : 0.00 0 0 0 0 0
3.29/3.35 c clique : 0.00 0 0 0 0 0
3.29/3.35 c zerohalf : 0.00 0 0 0 0 0
3.29/3.35 c mcf : 0.00 0 0 0 0 0
3.29/3.35 c rapidlearning : 0.00 0 0 0 0 0
3.29/3.35 c Pricers : Time Calls Vars
3.29/3.35 c problem variables: 0.00 0 0
3.29/3.35 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.29/3.35 c relpscost : 0.00 0 0 0 0 0 0
3.29/3.35 c pscost : 0.00 0 0 0 0 0 0
3.29/3.35 c inference : 0.40 402 0 0 0 0 804
3.29/3.35 c mostinf : 0.00 0 0 0 0 0 0
3.29/3.35 c leastinf : 0.00 0 0 0 0 0 0
3.29/3.35 c fullstrong : 0.00 0 0 0 0 0 0
3.29/3.35 c allfullstrong : 0.00 0 0 0 0 0 0
3.29/3.35 c random : 0.00 0 0 0 0 0 0
3.29/3.35 c Primal Heuristics : Time Calls Found
3.29/3.35 c LP solutions : 0.00 - 0
3.29/3.35 c pseudo solutions : 0.00 - 0
3.29/3.35 c trivial : 0.01 1 0
3.29/3.35 c simplerounding : 0.00 0 0
3.29/3.35 c zirounding : 0.00 0 0
3.29/3.35 c rounding : 0.00 0 0
3.29/3.35 c shifting : 0.00 0 0
3.29/3.35 c intshifting : 0.00 0 0
3.29/3.35 c oneopt : 0.00 0 0
3.29/3.35 c twoopt : 0.00 0 0
3.29/3.35 c fixandinfer : 0.00 0 0
3.29/3.35 c feaspump : 0.00 0 0
3.29/3.35 c coefdiving : 0.00 0 0
3.29/3.35 c pscostdiving : 0.00 0 0
3.29/3.35 c fracdiving : 0.00 0 0
3.29/3.35 c veclendiving : 0.00 0 0
3.29/3.35 c intdiving : 0.00 0 0
3.29/3.35 c actconsdiving : 0.00 0 0
3.29/3.35 c objpscostdiving : 0.00 0 0
3.29/3.35 c rootsoldiving : 0.00 0 0
3.29/3.35 c linesearchdiving : 0.00 0 0
3.29/3.35 c guideddiving : 0.00 0 0
3.29/3.35 c octane : 0.00 0 0
3.29/3.35 c rens : 0.00 0 0
3.29/3.35 c rins : 0.00 0 0
3.29/3.35 c localbranching : 0.00 0 0
3.29/3.35 c mutation : 0.00 0 0
3.29/3.35 c crossover : 0.00 0 0
3.29/3.35 c dins : 0.00 0 0
3.29/3.35 c undercover : 0.00 0 0
3.29/3.35 c nlp : 0.00 0 0
3.29/3.35 c trysol : 0.00 0 0
3.29/3.35 c LP : Time Calls Iterations Iter/call Iter/sec
3.29/3.35 c primal LP : 0.00 0 0 0.00 -
3.29/3.35 c dual LP : 0.00 0 0 0.00 -
3.29/3.35 c lex dual LP : 0.00 0 0 0.00 -
3.29/3.35 c barrier LP : 0.00 0 0 0.00 -
3.29/3.35 c diving/probing LP: 0.00 0 0 0.00 -
3.29/3.35 c strong branching : 0.00 0 0 0.00 -
3.29/3.35 c (at root node) : - 0 0 0.00 -
3.29/3.35 c conflict analysis: 0.00 0 0 0.00 -
3.29/3.35 c B&B Tree :
3.29/3.35 c number of runs : 1
3.29/3.35 c nodes : 440
3.29/3.35 c nodes (total) : 440
3.29/3.35 c nodes left : 0
3.29/3.35 c max depth : 220
3.29/3.35 c max depth (total): 220
3.29/3.35 c backtracks : 36 (8.2%)
3.29/3.35 c delayed cutoffs : 365
3.29/3.35 c repropagations : 203 (14336 domain reductions, 28 cutoffs)
3.29/3.35 c avg switch length: 2.72
3.29/3.35 c switching time : 0.23
3.29/3.35 c Solution :
3.29/3.35 c Solutions found : 0 (0 improvements)
3.29/3.35 c Primal Bound : infeasible
3.29/3.35 c Dual Bound : -
3.29/3.35 c Gap : 0.00 %
3.29/3.35 c Root Dual Bound : +0.00000000000000e+00
3.29/3.35 c Root Iterations : 0
3.39/3.42 c Time complete: 3.41.