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-2664576-1276341098.opb>
0.29/0.36 c original problem has 6832 variables (6832 bin, 0 int, 0 impl, 0 cont) and 19477 constraints
0.29/0.36 c problem read
0.29/0.36 c No objective function, only one solution is needed.
0.29/0.36 c presolving settings loaded
0.29/0.37 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.47 c presolving:
0.79/0.87 c (round 1) 690 del vars, 622 del conss, 228 chg bounds, 262 chg sides, 628 chg coeffs, 0 upgd conss, 375793 impls, 0 clqs
0.89/0.92 c (round 2) 708 del vars, 1724 del conss, 241 chg bounds, 262 chg sides, 628 chg coeffs, 0 upgd conss, 375941 impls, 0 clqs
0.89/0.94 c (round 3) 725 del vars, 1757 del conss, 248 chg bounds, 262 chg sides, 628 chg coeffs, 0 upgd conss, 376155 impls, 0 clqs
0.89/0.96 c (round 4) 726 del vars, 1783 del conss, 248 chg bounds, 262 chg sides, 628 chg coeffs, 0 upgd conss, 376237 impls, 0 clqs
0.89/0.98 c (round 5) 726 del vars, 1785 del conss, 248 chg bounds, 262 chg sides, 628 chg coeffs, 0 upgd conss, 376237 impls, 0 clqs
1.10/1.19 c (round 6) 726 del vars, 1799 del conss, 248 chg bounds, 262 chg sides, 628 chg coeffs, 17678 upgd conss, 376237 impls, 0 clqs
1.20/1.24 c presolving (7 rounds):
1.20/1.24 c 726 deleted vars, 1799 deleted constraints, 248 tightened bounds, 0 added holes, 262 changed sides, 628 changed coefficients
1.20/1.24 c 376237 implications, 0 cliques
1.20/1.24 c presolved problem has 6106 variables (6106 bin, 0 int, 0 impl, 0 cont) and 17678 constraints
1.20/1.24 c 524 constraints of type <knapsack>
1.20/1.24 c 17154 constraints of type <logicor>
1.20/1.24 c transformed objective value is always integral (scale: 1)
1.20/1.24 c Presolving Time: 0.67
1.20/1.24 c - non default parameters ----------------------------------------------------------------------
1.20/1.24 c # SCIP version 1.2.1.2
1.20/1.24 c
1.20/1.24 c # frequency for displaying node information lines
1.20/1.24 c # [type: int, range: [-1,2147483647], default: 100]
1.20/1.24 c display/freq = 10000
1.20/1.24 c
1.20/1.24 c # maximal time in seconds to run
1.20/1.24 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.20/1.24 c limits/time = 1799.64
1.20/1.24 c
1.20/1.24 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.20/1.24 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.20/1.24 c limits/memory = 1620
1.20/1.24 c
1.20/1.24 c # solving stops, if the given number of solutions were found (-1: no limit)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: -1]
1.20/1.24 c limits/solutions = 1
1.20/1.24 c
1.20/1.24 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: 1]
1.20/1.24 c lp/solvefreq = -1
1.20/1.24 c
1.20/1.24 c # maximal number of separation rounds per node (-1: unlimited)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: 5]
1.20/1.24 c separating/maxrounds = 1
1.20/1.24 c
1.20/1.24 c # maximal number of separation rounds in the root node (-1: unlimited)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: -1]
1.20/1.24 c separating/maxroundsroot = 5
1.20/1.24 c
1.20/1.24 c # should presolving try to simplify inequalities
1.20/1.24 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.20/1.24 c constraints/linear/simplifyinequalities = TRUE
1.20/1.24 c
1.20/1.24 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.20/1.24 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.20/1.24 c constraints/knapsack/disaggregation = FALSE
1.20/1.24 c
1.20/1.24 c # should presolving try to simplify knapsacks
1.20/1.24 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.20/1.24 c constraints/knapsack/simplifyinequalities = TRUE
1.20/1.24 c
1.20/1.24 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: -1]
1.20/1.24 c presolving/probing/maxrounds = 0
1.20/1.24 c
1.20/1.24 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: 10]
1.20/1.24 c heuristics/coefdiving/freq = -1
1.20/1.24 c
1.20/1.24 c # maximal fraction of diving LP iterations compared to node LP iterations
1.20/1.24 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.20/1.24 c heuristics/coefdiving/maxlpiterquot = 0.075
1.20/1.24 c
1.20/1.24 c # additional number of allowed LP iterations
1.20/1.24 c # [type: int, range: [0,2147483647], default: 1000]
1.20/1.24 c heuristics/coefdiving/maxlpiterofs = 1500
1.20/1.24 c
1.20/1.24 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: 30]
1.20/1.24 c heuristics/crossover/freq = -1
1.20/1.24 c
1.20/1.24 c # number of nodes added to the contingent of the total nodes
1.20/1.24 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.20/1.24 c heuristics/crossover/nodesofs = 750
1.20/1.24 c
1.20/1.24 c # number of nodes without incumbent change that heuristic should wait
1.20/1.24 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.20/1.24 c heuristics/crossover/nwaitingnodes = 100
1.20/1.24 c
1.20/1.24 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.20/1.24 c # [type: real, range: [0,1], default: 0.1]
1.20/1.24 c heuristics/crossover/nodesquot = 0.15
1.20/1.24 c
1.20/1.24 c # minimum percentage of integer variables that have to be fixed
1.20/1.24 c # [type: real, range: [0,1], default: 0.666]
1.20/1.24 c heuristics/crossover/minfixingrate = 0.5
1.20/1.24 c
1.20/1.24 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: 20]
1.20/1.24 c heuristics/feaspump/freq = -1
1.20/1.24 c
1.20/1.24 c # additional number of allowed LP iterations
1.20/1.24 c # [type: int, range: [0,2147483647], default: 1000]
1.20/1.24 c heuristics/feaspump/maxlpiterofs = 2000
1.20/1.24 c
1.20/1.24 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: 10]
1.20/1.24 c heuristics/fracdiving/freq = -1
1.20/1.24 c
1.20/1.24 c # maximal fraction of diving LP iterations compared to node LP iterations
1.20/1.24 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.20/1.24 c heuristics/fracdiving/maxlpiterquot = 0.075
1.20/1.24 c
1.20/1.24 c # additional number of allowed LP iterations
1.20/1.24 c # [type: int, range: [0,2147483647], default: 1000]
1.20/1.24 c heuristics/fracdiving/maxlpiterofs = 1500
1.20/1.24 c
1.20/1.24 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: 10]
1.20/1.24 c heuristics/guideddiving/freq = -1
1.20/1.24 c
1.20/1.24 c # maximal fraction of diving LP iterations compared to node LP iterations
1.20/1.24 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.20/1.24 c heuristics/guideddiving/maxlpiterquot = 0.075
1.20/1.24 c
1.20/1.24 c # additional number of allowed LP iterations
1.20/1.24 c # [type: int, range: [0,2147483647], default: 1000]
1.20/1.24 c heuristics/guideddiving/maxlpiterofs = 1500
1.20/1.24 c
1.20/1.24 c # maximal fraction of diving LP iterations compared to node LP iterations
1.20/1.24 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.20/1.24 c heuristics/intdiving/maxlpiterquot = 0.075
1.20/1.24 c
1.20/1.24 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: 10]
1.20/1.24 c heuristics/intshifting/freq = -1
1.20/1.24 c
1.20/1.24 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: 10]
1.20/1.24 c heuristics/linesearchdiving/freq = -1
1.20/1.24 c
1.20/1.24 c # maximal fraction of diving LP iterations compared to node LP iterations
1.20/1.24 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.20/1.24 c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.20/1.24 c
1.20/1.24 c # additional number of allowed LP iterations
1.20/1.24 c # [type: int, range: [0,2147483647], default: 1000]
1.20/1.24 c heuristics/linesearchdiving/maxlpiterofs = 1500
1.20/1.24 c
1.20/1.24 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: 1]
1.20/1.24 c heuristics/nlp/freq = -1
1.20/1.24 c
1.20/1.24 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: 20]
1.20/1.24 c heuristics/objpscostdiving/freq = -1
1.20/1.24 c
1.20/1.24 c # maximal fraction of diving LP iterations compared to total iteration number
1.20/1.24 c # [type: real, range: [0,1], default: 0.01]
1.20/1.24 c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.20/1.24 c
1.20/1.24 c # additional number of allowed LP iterations
1.20/1.24 c # [type: int, range: [0,2147483647], default: 1000]
1.20/1.24 c heuristics/objpscostdiving/maxlpiterofs = 1500
1.20/1.24 c
1.20/1.24 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: 1]
1.20/1.24 c heuristics/oneopt/freq = -1
1.20/1.24 c
1.20/1.24 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: 10]
1.20/1.24 c heuristics/pscostdiving/freq = -1
1.20/1.24 c
1.20/1.24 c # maximal fraction of diving LP iterations compared to node LP iterations
1.20/1.24 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.20/1.24 c heuristics/pscostdiving/maxlpiterquot = 0.075
1.20/1.24 c
1.20/1.24 c # additional number of allowed LP iterations
1.20/1.24 c # [type: int, range: [0,2147483647], default: 1000]
1.20/1.24 c heuristics/pscostdiving/maxlpiterofs = 1500
1.20/1.24 c
1.20/1.24 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: 0]
1.20/1.24 c heuristics/rens/freq = -1
1.20/1.24 c
1.20/1.24 c # minimum percentage of integer variables that have to be fixable
1.20/1.24 c # [type: real, range: [0,1], default: 0.5]
1.20/1.24 c heuristics/rens/minfixingrate = 0.3
1.20/1.24 c
1.20/1.24 c # number of nodes added to the contingent of the total nodes
1.20/1.24 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.20/1.24 c heuristics/rens/nodesofs = 2000
1.20/1.24 c
1.20/1.24 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.20/1.24 c # [type: int, range: [-1,2147483647], default: 20]
1.20/1.24 c heuristics/rootsoldiving/freq = -1
1.20/1.24 c
1.20/1.24 c # maximal fraction of diving LP iterations compared to node LP iterations
1.20/1.24 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.20/1.24 c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.20/1.25 c
1.20/1.25 c # additional number of allowed LP iterations
1.20/1.25 c # [type: int, range: [0,2147483647], default: 1000]
1.20/1.25 c heuristics/rootsoldiving/maxlpiterofs = 1500
1.20/1.25 c
1.20/1.25 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: 1]
1.20/1.25 c heuristics/rounding/freq = -1
1.20/1.25 c
1.20/1.25 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: 10]
1.20/1.25 c heuristics/shifting/freq = -1
1.20/1.25 c
1.20/1.25 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: 1]
1.20/1.25 c heuristics/simplerounding/freq = -1
1.20/1.25 c
1.20/1.25 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: 0]
1.20/1.25 c heuristics/trivial/freq = -1
1.20/1.25 c
1.20/1.25 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: 1]
1.20/1.25 c heuristics/trysol/freq = -1
1.20/1.25 c
1.20/1.25 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: 10]
1.20/1.25 c heuristics/veclendiving/freq = -1
1.20/1.25 c
1.20/1.25 c # maximal fraction of diving LP iterations compared to node LP iterations
1.20/1.25 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.20/1.25 c heuristics/veclendiving/maxlpiterquot = 0.075
1.20/1.25 c
1.20/1.25 c # additional number of allowed LP iterations
1.20/1.25 c # [type: int, range: [0,2147483647], default: 1000]
1.20/1.25 c heuristics/veclendiving/maxlpiterofs = 1500
1.20/1.25 c
1.20/1.25 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: 1]
1.20/1.25 c heuristics/zirounding/freq = -1
1.20/1.25 c
1.20/1.25 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: 0]
1.20/1.25 c separating/cmir/freq = -1
1.20/1.25 c
1.20/1.25 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: 0]
1.20/1.25 c separating/flowcover/freq = -1
1.20/1.25 c
1.20/1.25 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.20/1.25 c # [type: int, range: [-1,2147483647], default: -1]
1.20/1.25 c separating/rapidlearning/freq = 0
1.20/1.25 c
1.20/1.25 c -----------------------------------------------------------------------------------------------
1.20/1.25 c start solving
1.20/1.25 c
1.20/1.27 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.20/1.27 c 0.8s| 1 | 2 | 0 | - | 36M| 0 | - |6106 | 17k| 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
40.47/40.58 c
40.47/40.58 c SCIP Status : problem is solved [infeasible]
40.47/40.58 c Solving Time (sec) : 39.38
40.47/40.58 c Solving Nodes : 4587
40.47/40.58 c Primal Bound : +1.00000000000000e+20 (0 solutions)
40.47/40.58 c Dual Bound : +1.00000000000000e+20
40.47/40.58 c Gap : 0.00 %
40.47/40.58 s UNSATISFIABLE
40.47/40.58 c SCIP Status : problem is solved [infeasible]
40.47/40.58 c Solving Time : 39.38
40.47/40.58 c Original Problem :
40.47/40.58 c Problem name : HOME/instance-2664576-1276341098.opb
40.47/40.58 c Variables : 6832 (6832 binary, 0 integer, 0 implicit integer, 0 continuous)
40.47/40.58 c Constraints : 19477 initial, 19477 maximal
40.47/40.58 c Presolved Problem :
40.47/40.58 c Problem name : t_HOME/instance-2664576-1276341098.opb
40.47/40.58 c Variables : 6106 (6106 binary, 0 integer, 0 implicit integer, 0 continuous)
40.47/40.58 c Constraints : 17678 initial, 19119 maximal
40.47/40.58 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
40.47/40.58 c trivial : 0.00 4 0 0 0 0 0 0 0
40.47/40.58 c dualfix : 0.01 0 0 0 0 0 0 0 0
40.47/40.58 c boundshift : 0.00 0 0 0 0 0 0 0 0
40.47/40.58 c inttobinary : 0.00 0 0 0 0 0 0 0 0
40.47/40.58 c implics : 0.08 0 470 0 0 0 0 0 0
40.47/40.58 c probing : 0.00 0 0 0 0 0 0 0 0
40.47/40.58 c knapsack : 0.00 0 0 0 0 0 0 0 0
40.47/40.58 c linear : 0.44 248 4 0 248 0 1799 262 628
40.47/40.58 c logicor : 0.07 0 0 0 0 0 0 0 0
40.47/40.58 c root node : - 455 - - 455 - - - -
40.47/40.58 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
40.47/40.58 c integral : 0 0 0 0 0 0 0 0 0 0
40.47/40.58 c knapsack : 524 0 91926 0 3718 111 2895 0 0 0
40.47/40.58 c logicor : 17154+ 0 89813 0 3718 1457 1119586 0 0 0
40.47/40.58 c countsols : 0 0 0 0 3718 0 0 0 0 0
40.47/40.58 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
40.47/40.58 c integral : 0.00 0.00 0.00 0.00 0.00
40.47/40.58 c knapsack : 1.48 0.00 1.44 0.00 0.04
40.47/40.58 c logicor : 20.98 0.00 9.47 0.00 11.51
40.47/40.58 c countsols : 0.00 0.00 0.00 0.00 0.00
40.47/40.58 c Propagators : Time Calls Cutoffs DomReds
40.47/40.58 c vbounds : 0.05 1 0 0
40.47/40.58 c rootredcost : 0.06 0 0 0
40.47/40.58 c pseudoobj : 0.03 0 0 0
40.47/40.58 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
40.47/40.58 c propagation : 0.82 1568 1565 11442 35.2 221 14.5 -
40.47/40.58 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
40.47/40.58 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
40.47/40.58 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
40.47/40.58 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
40.47/40.58 c applied globally : - - - 4885 29.7 - - -
40.47/40.58 c applied locally : - - - 0 0.0 - - -
40.47/40.58 c Separators : Time Calls Cutoffs DomReds Cuts Conss
40.47/40.58 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
40.47/40.58 c redcost : 0.00 0 0 0 0 0
40.47/40.58 c impliedbounds : 0.00 0 0 0 0 0
40.47/40.58 c intobj : 0.00 0 0 0 0 0
40.47/40.58 c cgmip : 0.00 0 0 0 0 0
40.47/40.58 c gomory : 0.00 0 0 0 0 0
40.47/40.58 c strongcg : 0.00 0 0 0 0 0
40.47/40.58 c cmir : 0.00 0 0 0 0 0
40.47/40.58 c flowcover : 0.00 0 0 0 0 0
40.47/40.58 c clique : 0.00 0 0 0 0 0
40.47/40.58 c zerohalf : 0.00 0 0 0 0 0
40.47/40.58 c mcf : 0.00 0 0 0 0 0
40.47/40.58 c rapidlearning : 0.00 0 0 0 0 0
40.47/40.58 c Pricers : Time Calls Vars
40.47/40.58 c problem variables: 0.00 0 0
40.47/40.58 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
40.47/40.58 c relpscost : 0.00 0 0 0 0 0 0
40.47/40.58 c pscost : 0.00 0 0 0 0 0 0
40.47/40.58 c inference : 4.14 3718 0 0 0 0 7436
40.47/40.58 c mostinf : 0.00 0 0 0 0 0 0
40.47/40.58 c leastinf : 0.00 0 0 0 0 0 0
40.47/40.58 c fullstrong : 0.00 0 0 0 0 0 0
40.47/40.58 c allfullstrong : 0.00 0 0 0 0 0 0
40.47/40.58 c random : 0.00 0 0 0 0 0 0
40.47/40.58 c Primal Heuristics : Time Calls Found
40.47/40.58 c LP solutions : 0.00 - 0
40.47/40.58 c pseudo solutions : 0.00 - 0
40.47/40.58 c trivial : 0.01 1 0
40.47/40.58 c simplerounding : 0.00 0 0
40.47/40.58 c zirounding : 0.00 0 0
40.47/40.58 c rounding : 0.00 0 0
40.47/40.58 c shifting : 0.00 0 0
40.47/40.58 c intshifting : 0.00 0 0
40.47/40.58 c oneopt : 0.00 0 0
40.47/40.58 c twoopt : 0.00 0 0
40.47/40.58 c fixandinfer : 0.00 0 0
40.47/40.58 c feaspump : 0.00 0 0
40.47/40.58 c coefdiving : 0.00 0 0
40.47/40.58 c pscostdiving : 0.00 0 0
40.47/40.58 c fracdiving : 0.00 0 0
40.47/40.58 c veclendiving : 0.00 0 0
40.47/40.58 c intdiving : 0.00 0 0
40.47/40.58 c actconsdiving : 0.00 0 0
40.47/40.58 c objpscostdiving : 0.00 0 0
40.47/40.58 c rootsoldiving : 0.00 0 0
40.47/40.58 c linesearchdiving : 0.00 0 0
40.47/40.58 c guideddiving : 0.00 0 0
40.47/40.58 c octane : 0.00 0 0
40.47/40.58 c rens : 0.00 0 0
40.47/40.58 c rins : 0.00 0 0
40.47/40.58 c localbranching : 0.00 0 0
40.47/40.58 c mutation : 0.00 0 0
40.47/40.58 c crossover : 0.00 0 0
40.47/40.58 c dins : 0.00 0 0
40.47/40.58 c undercover : 0.00 0 0
40.47/40.58 c nlp : 0.00 0 0
40.47/40.58 c trysol : 0.00 0 0
40.47/40.58 c LP : Time Calls Iterations Iter/call Iter/sec
40.47/40.58 c primal LP : 0.00 0 0 0.00 -
40.47/40.58 c dual LP : 0.00 0 0 0.00 -
40.47/40.58 c lex dual LP : 0.00 0 0 0.00 -
40.47/40.58 c barrier LP : 0.00 0 0 0.00 -
40.47/40.58 c diving/probing LP: 0.00 0 0 0.00 -
40.47/40.58 c strong branching : 0.00 0 0 0.00 -
40.47/40.58 c (at root node) : - 0 0 0.00 -
40.47/40.58 c conflict analysis: 0.00 0 0 0.00 -
40.47/40.58 c B&B Tree :
40.47/40.58 c number of runs : 1
40.47/40.58 c nodes : 4587
40.47/40.58 c nodes (total) : 4587
40.47/40.58 c nodes left : 0
40.47/40.58 c max depth : 185
40.47/40.58 c max depth (total): 185
40.47/40.58 c backtracks : 908 (19.8%)
40.47/40.58 c delayed cutoffs : 2850
40.47/40.58 c repropagations : 3507 (353299 domain reductions, 699 cutoffs)
40.47/40.58 c avg switch length: 4.47
40.47/40.58 c switching time : 9.50
40.47/40.58 c Solution :
40.47/40.58 c Solutions found : 0 (0 improvements)
40.47/40.58 c Primal Bound : infeasible
40.47/40.58 c Dual Bound : -
40.47/40.58 c Gap : 0.00 %
40.47/40.58 c Root Dual Bound : +0.00000000000000e+00
40.47/40.58 c Root Iterations : 0
40.57/40.67 c Time complete: 40.66.