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-2664567-1276336673.opb>
0.29/0.33 c original problem has 6392 variables (6392 bin, 0 int, 0 impl, 0 cont) and 18058 constraints
0.29/0.33 c problem read
0.29/0.33 c No objective function, only one solution is needed.
0.29/0.33 c presolving settings loaded
0.29/0.33 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.43 c presolving:
0.69/0.79 c (round 1) 1053 del vars, 1641 del conss, 469 chg bounds, 390 chg sides, 806 chg coeffs, 0 upgd conss, 361213 impls, 0 clqs
0.79/0.84 c (round 2) 1060 del vars, 2864 del conss, 471 chg bounds, 395 chg sides, 811 chg coeffs, 0 upgd conss, 362479 impls, 0 clqs
0.79/0.86 c (round 3) 1060 del vars, 2879 del conss, 471 chg bounds, 395 chg sides, 811 chg coeffs, 0 upgd conss, 362479 impls, 0 clqs
1.00/1.05 c (round 4) 1060 del vars, 2884 del conss, 471 chg bounds, 395 chg sides, 811 chg coeffs, 15174 upgd conss, 362479 impls, 0 clqs
1.00/1.10 c presolving (5 rounds):
1.00/1.10 c 1060 deleted vars, 2884 deleted constraints, 471 tightened bounds, 0 added holes, 395 changed sides, 811 changed coefficients
1.00/1.10 c 362479 implications, 0 cliques
1.00/1.10 c presolved problem has 5332 variables (5332 bin, 0 int, 0 impl, 0 cont) and 15174 constraints
1.00/1.10 c 780 constraints of type <knapsack>
1.00/1.10 c 14394 constraints of type <logicor>
1.00/1.10 c transformed objective value is always integral (scale: 1)
1.00/1.10 c Presolving Time: 0.61
1.00/1.10 c - non default parameters ----------------------------------------------------------------------
1.00/1.10 c # SCIP version 1.2.1.2
1.00/1.10 c
1.00/1.10 c # frequency for displaying node information lines
1.00/1.10 c # [type: int, range: [-1,2147483647], default: 100]
1.00/1.10 c display/freq = 10000
1.00/1.10 c
1.00/1.10 c # maximal time in seconds to run
1.00/1.10 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.00/1.10 c limits/time = 1799.68
1.00/1.10 c
1.00/1.10 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.00/1.10 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.00/1.10 c limits/memory = 1620
1.00/1.10 c
1.00/1.10 c # solving stops, if the given number of solutions were found (-1: no limit)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: -1]
1.00/1.10 c limits/solutions = 1
1.00/1.10 c
1.00/1.10 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.10 c lp/solvefreq = -1
1.00/1.10 c
1.00/1.10 c # maximal number of separation rounds per node (-1: unlimited)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: 5]
1.00/1.10 c separating/maxrounds = 1
1.00/1.10 c
1.00/1.10 c # maximal number of separation rounds in the root node (-1: unlimited)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: -1]
1.00/1.10 c separating/maxroundsroot = 5
1.00/1.10 c
1.00/1.10 c # should presolving try to simplify inequalities
1.00/1.10 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.00/1.10 c constraints/linear/simplifyinequalities = TRUE
1.00/1.10 c
1.00/1.10 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.00/1.10 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.00/1.10 c constraints/knapsack/disaggregation = FALSE
1.00/1.10 c
1.00/1.10 c # should presolving try to simplify knapsacks
1.00/1.10 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.00/1.10 c constraints/knapsack/simplifyinequalities = TRUE
1.00/1.10 c
1.00/1.10 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: -1]
1.00/1.10 c presolving/probing/maxrounds = 0
1.00/1.10 c
1.00/1.10 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.10 c heuristics/coefdiving/freq = -1
1.00/1.10 c
1.00/1.10 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.10 c heuristics/coefdiving/maxlpiterquot = 0.075
1.00/1.10 c
1.00/1.10 c # additional number of allowed LP iterations
1.00/1.10 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.10 c heuristics/coefdiving/maxlpiterofs = 1500
1.00/1.10 c
1.00/1.10 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: 30]
1.00/1.10 c heuristics/crossover/freq = -1
1.00/1.10 c
1.00/1.10 c # number of nodes added to the contingent of the total nodes
1.00/1.10 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.00/1.10 c heuristics/crossover/nodesofs = 750
1.00/1.10 c
1.00/1.10 c # number of nodes without incumbent change that heuristic should wait
1.00/1.10 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.00/1.10 c heuristics/crossover/nwaitingnodes = 100
1.00/1.10 c
1.00/1.10 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.00/1.10 c # [type: real, range: [0,1], default: 0.1]
1.00/1.10 c heuristics/crossover/nodesquot = 0.15
1.00/1.10 c
1.00/1.10 c # minimum percentage of integer variables that have to be fixed
1.00/1.10 c # [type: real, range: [0,1], default: 0.666]
1.00/1.10 c heuristics/crossover/minfixingrate = 0.5
1.00/1.10 c
1.00/1.10 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: 20]
1.00/1.10 c heuristics/feaspump/freq = -1
1.00/1.10 c
1.00/1.10 c # additional number of allowed LP iterations
1.00/1.10 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.10 c heuristics/feaspump/maxlpiterofs = 2000
1.00/1.10 c
1.00/1.10 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.10 c heuristics/fracdiving/freq = -1
1.00/1.10 c
1.00/1.10 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.10 c heuristics/fracdiving/maxlpiterquot = 0.075
1.00/1.10 c
1.00/1.10 c # additional number of allowed LP iterations
1.00/1.10 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.10 c heuristics/fracdiving/maxlpiterofs = 1500
1.00/1.10 c
1.00/1.10 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.10 c heuristics/guideddiving/freq = -1
1.00/1.10 c
1.00/1.10 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.10 c heuristics/guideddiving/maxlpiterquot = 0.075
1.00/1.10 c
1.00/1.10 c # additional number of allowed LP iterations
1.00/1.10 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.10 c heuristics/guideddiving/maxlpiterofs = 1500
1.00/1.10 c
1.00/1.10 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.10 c heuristics/intdiving/maxlpiterquot = 0.075
1.00/1.10 c
1.00/1.10 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.10 c heuristics/intshifting/freq = -1
1.00/1.10 c
1.00/1.10 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.10 c heuristics/linesearchdiving/freq = -1
1.00/1.10 c
1.00/1.10 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.10 c heuristics/linesearchdiving/maxlpiterquot = 0.075
1.00/1.10 c
1.00/1.10 c # additional number of allowed LP iterations
1.00/1.10 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.10 c heuristics/linesearchdiving/maxlpiterofs = 1500
1.00/1.10 c
1.00/1.10 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.10 c heuristics/nlp/freq = -1
1.00/1.10 c
1.00/1.10 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: 20]
1.00/1.10 c heuristics/objpscostdiving/freq = -1
1.00/1.10 c
1.00/1.10 c # maximal fraction of diving LP iterations compared to total iteration number
1.00/1.10 c # [type: real, range: [0,1], default: 0.01]
1.00/1.10 c heuristics/objpscostdiving/maxlpiterquot = 0.015
1.00/1.10 c
1.00/1.10 c # additional number of allowed LP iterations
1.00/1.10 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.10 c heuristics/objpscostdiving/maxlpiterofs = 1500
1.00/1.10 c
1.00/1.10 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.10 c heuristics/oneopt/freq = -1
1.00/1.10 c
1.00/1.10 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.10 c heuristics/pscostdiving/freq = -1
1.00/1.10 c
1.00/1.10 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.10 c heuristics/pscostdiving/maxlpiterquot = 0.075
1.00/1.10 c
1.00/1.10 c # additional number of allowed LP iterations
1.00/1.10 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.10 c heuristics/pscostdiving/maxlpiterofs = 1500
1.00/1.10 c
1.00/1.10 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: 0]
1.00/1.10 c heuristics/rens/freq = -1
1.00/1.10 c
1.00/1.10 c # minimum percentage of integer variables that have to be fixable
1.00/1.10 c # [type: real, range: [0,1], default: 0.5]
1.00/1.10 c heuristics/rens/minfixingrate = 0.3
1.00/1.10 c
1.00/1.10 c # number of nodes added to the contingent of the total nodes
1.00/1.10 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.00/1.10 c heuristics/rens/nodesofs = 2000
1.00/1.10 c
1.00/1.10 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: 20]
1.00/1.10 c heuristics/rootsoldiving/freq = -1
1.00/1.10 c
1.00/1.10 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.00/1.10 c heuristics/rootsoldiving/maxlpiterquot = 0.015
1.00/1.10 c
1.00/1.10 c # additional number of allowed LP iterations
1.00/1.10 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.10 c heuristics/rootsoldiving/maxlpiterofs = 1500
1.00/1.10 c
1.00/1.10 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.10 c heuristics/rounding/freq = -1
1.00/1.10 c
1.00/1.10 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.10 c heuristics/shifting/freq = -1
1.00/1.10 c
1.00/1.10 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.10 c heuristics/simplerounding/freq = -1
1.00/1.10 c
1.00/1.10 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: 0]
1.00/1.10 c heuristics/trivial/freq = -1
1.00/1.10 c
1.00/1.10 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.10 c heuristics/trysol/freq = -1
1.00/1.10 c
1.00/1.10 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: 10]
1.00/1.10 c heuristics/veclendiving/freq = -1
1.00/1.10 c
1.00/1.10 c # maximal fraction of diving LP iterations compared to node LP iterations
1.00/1.10 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.00/1.10 c heuristics/veclendiving/maxlpiterquot = 0.075
1.00/1.10 c
1.00/1.10 c # additional number of allowed LP iterations
1.00/1.10 c # [type: int, range: [0,2147483647], default: 1000]
1.00/1.10 c heuristics/veclendiving/maxlpiterofs = 1500
1.00/1.10 c
1.00/1.10 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: 1]
1.00/1.10 c heuristics/zirounding/freq = -1
1.00/1.10 c
1.00/1.10 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: 0]
1.00/1.10 c separating/cmir/freq = -1
1.00/1.10 c
1.00/1.10 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: 0]
1.00/1.10 c separating/flowcover/freq = -1
1.00/1.10 c
1.00/1.10 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.00/1.10 c # [type: int, range: [-1,2147483647], default: -1]
1.00/1.10 c separating/rapidlearning/freq = 0
1.00/1.10 c
1.00/1.10 c -----------------------------------------------------------------------------------------------
1.00/1.10 c start solving
1.10/1.11 c
1.10/1.13 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.10/1.13 c 0.7s| 1 | 2 | 0 | - | 34M| 0 | - |5332 | 15k| 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
61.67/61.72 c
61.67/61.72 c SCIP Status : problem is solved [infeasible]
61.67/61.72 c Solving Time (sec) : 60.42
61.67/61.72 c Solving Nodes : 8604
61.67/61.72 c Primal Bound : +1.00000000000000e+20 (0 solutions)
61.67/61.72 c Dual Bound : +1.00000000000000e+20
61.67/61.72 c Gap : 0.00 %
61.67/61.72 s UNSATISFIABLE
61.67/61.72 c SCIP Status : problem is solved [infeasible]
61.67/61.72 c Solving Time : 60.42
61.67/61.72 c Original Problem :
61.67/61.72 c Problem name : HOME/instance-2664567-1276336673.opb
61.67/61.72 c Variables : 6392 (6392 binary, 0 integer, 0 implicit integer, 0 continuous)
61.67/61.72 c Constraints : 18058 initial, 18058 maximal
61.67/61.72 c Presolved Problem :
61.67/61.72 c Problem name : t_HOME/instance-2664567-1276336673.opb
61.67/61.72 c Variables : 5332 (5332 binary, 0 integer, 0 implicit integer, 0 continuous)
61.67/61.72 c Constraints : 15174 initial, 16744 maximal
61.67/61.72 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
61.67/61.72 c trivial : 0.00 0 0 0 0 0 0 0 0
61.67/61.72 c dualfix : 0.00 0 0 0 0 0 0 0 0
61.67/61.72 c boundshift : 0.00 0 0 0 0 0 0 0 0
61.67/61.72 c inttobinary : 0.00 0 0 0 0 0 0 0 0
61.67/61.72 c implics : 0.06 0 585 0 0 0 0 0 0
61.67/61.72 c probing : 0.00 0 0 0 0 0 0 0 0
61.67/61.72 c knapsack : 0.01 0 0 0 0 0 0 0 0
61.67/61.72 c linear : 0.40 471 4 0 471 0 2884 395 811
61.67/61.72 c logicor : 0.07 0 0 0 0 0 0 0 0
61.67/61.72 c root node : - 2014 - - 2014 - - - -
61.67/61.72 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
61.67/61.72 c integral : 0 0 0 0 0 0 0 0 0 0
61.67/61.72 c knapsack : 780 0 108560 0 7672 56 6469 0 0 0
61.67/61.72 c logicor : 14394+ 0 106148 0 7672 1586 860572 0 0 0
61.67/61.72 c countsols : 0 0 0 0 7672 0 0 0 0 0
61.67/61.72 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
61.67/61.72 c integral : 0.00 0.00 0.00 0.00 0.00
61.67/61.72 c knapsack : 3.29 0.00 3.27 0.00 0.02
61.67/61.72 c logicor : 36.54 0.00 7.15 0.00 29.39
61.67/61.72 c countsols : 0.00 0.00 0.00 0.00 0.00
61.67/61.72 c Propagators : Time Calls Cutoffs DomReds
61.67/61.72 c vbounds : 0.11 1 0 0
61.67/61.72 c rootredcost : 0.05 0 0 0
61.67/61.72 c pseudoobj : 0.03 0 0 0
61.67/61.72 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
61.67/61.72 c propagation : 0.55 1642 1635 9604 36.3 180 17.9 -
61.67/61.72 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
61.67/61.72 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
61.67/61.72 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
61.67/61.72 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
61.67/61.72 c applied globally : - - - 4277 25.6 - - -
61.67/61.72 c applied locally : - - - 0 0.0 - - -
61.67/61.72 c Separators : Time Calls Cutoffs DomReds Cuts Conss
61.67/61.72 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
61.67/61.72 c redcost : 0.00 0 0 0 0 0
61.67/61.72 c impliedbounds : 0.00 0 0 0 0 0
61.67/61.72 c intobj : 0.00 0 0 0 0 0
61.67/61.72 c cgmip : 0.00 0 0 0 0 0
61.67/61.72 c gomory : 0.00 0 0 0 0 0
61.67/61.72 c strongcg : 0.00 0 0 0 0 0
61.67/61.72 c cmir : 0.00 0 0 0 0 0
61.67/61.72 c flowcover : 0.00 0 0 0 0 0
61.67/61.72 c clique : 0.00 0 0 0 0 0
61.67/61.72 c zerohalf : 0.00 0 0 0 0 0
61.67/61.72 c mcf : 0.00 0 0 0 0 0
61.67/61.72 c rapidlearning : 0.00 0 0 0 0 0
61.67/61.72 c Pricers : Time Calls Vars
61.67/61.72 c problem variables: 0.00 0 0
61.67/61.72 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
61.67/61.72 c relpscost : 0.00 0 0 0 0 0 0
61.67/61.72 c pscost : 0.00 0 0 0 0 0 0
61.67/61.72 c inference : 10.28 7672 0 0 0 0 15344
61.67/61.72 c mostinf : 0.00 0 0 0 0 0 0
61.67/61.72 c leastinf : 0.00 0 0 0 0 0 0
61.67/61.72 c fullstrong : 0.00 0 0 0 0 0 0
61.67/61.72 c allfullstrong : 0.00 0 0 0 0 0 0
61.67/61.72 c random : 0.00 0 0 0 0 0 0
61.67/61.72 c Primal Heuristics : Time Calls Found
61.67/61.72 c LP solutions : 0.00 - 0
61.67/61.72 c pseudo solutions : 0.00 - 0
61.67/61.72 c trivial : 0.01 1 0
61.67/61.72 c simplerounding : 0.00 0 0
61.67/61.72 c zirounding : 0.00 0 0
61.67/61.72 c rounding : 0.00 0 0
61.67/61.72 c shifting : 0.00 0 0
61.67/61.72 c intshifting : 0.00 0 0
61.67/61.72 c oneopt : 0.00 0 0
61.67/61.72 c twoopt : 0.00 0 0
61.67/61.72 c fixandinfer : 0.00 0 0
61.67/61.72 c feaspump : 0.00 0 0
61.67/61.72 c coefdiving : 0.00 0 0
61.67/61.72 c pscostdiving : 0.00 0 0
61.67/61.72 c fracdiving : 0.00 0 0
61.67/61.72 c veclendiving : 0.00 0 0
61.67/61.72 c intdiving : 0.00 0 0
61.67/61.72 c actconsdiving : 0.00 0 0
61.67/61.72 c objpscostdiving : 0.00 0 0
61.67/61.72 c rootsoldiving : 0.00 0 0
61.67/61.72 c linesearchdiving : 0.00 0 0
61.67/61.72 c guideddiving : 0.00 0 0
61.67/61.72 c octane : 0.00 0 0
61.67/61.72 c rens : 0.00 0 0
61.67/61.72 c rins : 0.00 0 0
61.67/61.72 c localbranching : 0.00 0 0
61.67/61.72 c mutation : 0.00 0 0
61.67/61.72 c crossover : 0.00 0 0
61.67/61.72 c dins : 0.00 0 0
61.67/61.72 c undercover : 0.00 0 0
61.67/61.72 c nlp : 0.00 0 0
61.67/61.72 c trysol : 0.00 0 0
61.67/61.72 c LP : Time Calls Iterations Iter/call Iter/sec
61.67/61.72 c primal LP : 0.00 0 0 0.00 -
61.67/61.72 c dual LP : 0.00 0 0 0.00 -
61.67/61.72 c lex dual LP : 0.00 0 0 0.00 -
61.67/61.72 c barrier LP : 0.00 0 0 0.00 -
61.67/61.72 c diving/probing LP: 0.00 0 0 0.00 -
61.67/61.72 c strong branching : 0.00 0 0 0.00 -
61.67/61.72 c (at root node) : - 0 0 0.00 -
61.67/61.72 c conflict analysis: 0.00 0 0 0.00 -
61.67/61.72 c B&B Tree :
61.67/61.72 c number of runs : 1
61.67/61.72 c nodes : 8604
61.67/61.72 c nodes (total) : 8604
61.67/61.72 c nodes left : 0
61.67/61.72 c max depth : 168
61.67/61.72 c max depth (total): 168
61.67/61.72 c backtracks : 992 (11.5%)
61.67/61.72 c delayed cutoffs : 6741
61.67/61.72 c repropagations : 4465 (224261 domain reductions, 710 cutoffs)
61.67/61.72 c avg switch length: 4.03
61.67/61.72 c switching time : 7.16
61.67/61.72 c Solution :
61.67/61.72 c Solutions found : 0 (0 improvements)
61.67/61.72 c Primal Bound : infeasible
61.67/61.72 c Dual Bound : -
61.67/61.72 c Gap : 0.00 %
61.67/61.72 c Root Dual Bound : +0.00000000000000e+00
61.67/61.72 c Root Iterations : 0
61.77/61.81 c Time complete: 61.78.