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-2664351-1276278156.opb>
0.00/0.01 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.01 c problem read
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c presolving settings loaded
0.00/0.01 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.00/0.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.03 c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.03 c presolving (3 rounds):
0.00/0.03 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 8 implications, 68 cliques
0.00/0.03 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.03 c 1 constraints of type <knapsack>
0.00/0.03 c 68 constraints of type <setppc>
0.00/0.03 c 4 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.00
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.2
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1800
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c limits/solutions = 1
0.00/0.03 c
0.00/0.03 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c lp/solvefreq = -1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03 c separating/maxrounds = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/maxroundsroot = 5
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03 c constraints/knapsack/disaggregation = FALSE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c presolving/probing/maxrounds = 0
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/coefdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03 c heuristics/crossover/freq = -1
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/crossover/nodesofs = 750
0.00/0.03 c
0.00/0.03 c # number of nodes without incumbent change that heuristic should wait
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03 c heuristics/crossover/nwaitingnodes = 100
0.00/0.03 c
0.00/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03 c # [type: real, range: [0,1], default: 0.1]
0.00/0.03 c heuristics/crossover/nodesquot = 0.15
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixed
0.00/0.03 c # [type: real, range: [0,1], default: 0.666]
0.00/0.03 c heuristics/crossover/minfixingrate = 0.5
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/feaspump/freq = -1
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/fracdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/guideddiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/intshifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/linesearchdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/nlp/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/objpscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.03 c # [type: real, range: [0,1], default: 0.01]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/oneopt/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/pscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/rens/freq = -1
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixable
0.00/0.03 c # [type: real, range: [0,1], default: 0.5]
0.00/0.03 c heuristics/rens/minfixingrate = 0.3
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/rens/nodesofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/rootsoldiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/rounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/shifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/simplerounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/trivial/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/trysol/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/veclendiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/zirounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/cmir/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/flowcover/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.00/0.03 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.03 c 0.0s| 1 | 2 | 0 | - | 633k| 0 | - | 169 | 73 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
2.69/2.78 c 2.5s| 10000 | 6308 | 0 | 0.0 |5857k| 76 | - | 169 |2992 | 0 | 0 | 0 |3132 | 0 | 0.000000e+00 | -- | Inf
7.99/8.02 c 7.5s| 20000 | 10563 | 0 | 0.0 | 10M| 76 | - | 169 |3781 | 0 | 0 | 0 |7768 | 0 | 0.000000e+00 | -- | Inf
14.89/14.93 c 14.2s| 30000 | 13422 | 0 | 0.0 | 14M| 76 | - | 169 |5726 | 0 | 0 | 0 | 13k| 0 | 0.000000e+00 | -- | Inf
26.48/26.58 c 25.5s| 40000 | 12882 | 0 | 0.0 | 16M| 76 | - | 169 |5948 | 0 | 0 | 0 | 22k| 0 | 0.000000e+00 | -- | Inf
40.08/40.18 c 38.8s| 50000 | 11630 | 0 | 0.0 | 18M| 76 | - | 169 |8641 | 0 | 0 | 0 | 31k| 0 | 0.000000e+00 | -- | Inf
60.96/61.06 c 59.4s| 60000 | 8252 | 0 | 0.0 | 17M| 76 | - | 169 | 10k| 0 | 0 | 0 | 42k| 0 | 0.000000e+00 | -- | Inf
87.16/87.27 c
87.16/87.27 c SCIP Status : problem is solved [infeasible]
87.16/87.27 c Solving Time (sec) : 85.23
87.16/87.27 c Solving Nodes : 68062
87.16/87.27 c Primal Bound : +1.00000000000000e+20 (0 solutions)
87.16/87.27 c Dual Bound : +1.00000000000000e+20
87.16/87.27 c Gap : 0.00 %
87.16/87.27 s UNSATISFIABLE
87.16/87.27 c SCIP Status : problem is solved [infeasible]
87.16/87.27 c Solving Time : 85.23
87.16/87.27 c Original Problem :
87.16/87.27 c Problem name : HOME/instance-2664351-1276278156.opb
87.16/87.27 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
87.16/87.27 c Constraints : 101 initial, 101 maximal
87.16/87.27 c Presolved Problem :
87.16/87.27 c Problem name : t_HOME/instance-2664351-1276278156.opb
87.16/87.27 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
87.16/87.27 c Constraints : 73 initial, 15645 maximal
87.16/87.27 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
87.16/87.27 c trivial : 0.00 0 0 0 0 0 0 0 0
87.16/87.27 c dualfix : 0.00 0 0 0 0 0 0 0 0
87.16/87.27 c boundshift : 0.00 0 0 0 0 0 0 0 0
87.16/87.27 c inttobinary : 0.00 0 0 0 0 0 0 0 0
87.16/87.27 c implics : 0.00 0 0 0 0 0 0 0 0
87.16/87.27 c probing : 0.00 0 0 0 0 0 0 0 0
87.16/87.27 c knapsack : 0.00 0 0 0 0 0 0 0 0
87.16/87.27 c setppc : 0.00 0 0 0 0 0 0 0 0
87.16/87.27 c linear : 0.00 0 0 0 0 0 28 0 0
87.16/87.27 c logicor : 0.00 0 0 0 0 0 0 0 0
87.16/87.27 c root node : - 1 - - 1 - - - -
87.16/87.27 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
87.16/87.27 c integral : 0 0 0 0 0 0 0 0 0 0
87.16/87.27 c knapsack : 1 0 237363 0 42253 4331 914976 0 0 0
87.16/87.27 c setppc : 68 0 233032 0 42253 32683 502191 0 0 0
87.16/87.27 c logicor : 4+ 0 92473 0 25326 374 36853 0 0 0
87.16/87.27 c countsols : 0 0 0 0 42253 0 0 0 0 0
87.16/87.27 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
87.16/87.27 c integral : 0.00 0.00 0.00 0.00 0.00
87.16/87.27 c knapsack : 14.05 0.00 13.75 0.00 0.30
87.16/87.27 c setppc : 4.14 0.00 3.41 0.00 0.73
87.16/87.27 c logicor : 31.32 0.00 31.32 0.00 0.00
87.16/87.27 c countsols : 0.01 0.00 0.00 0.00 0.01
87.16/87.27 c Propagators : Time Calls Cutoffs DomReds
87.16/87.27 c vbounds : 0.16 1 0 0
87.16/87.27 c rootredcost : 0.07 0 0 0
87.16/87.27 c pseudoobj : 0.11 0 0 0
87.16/87.27 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
87.16/87.27 c propagation : 1.76 37388 37378 168070 17.4 999 22.1 -
87.16/87.27 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
87.16/87.27 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
87.16/87.27 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
87.16/87.27 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
87.16/87.27 c applied globally : - - - 54876 13.6 - - -
87.16/87.27 c applied locally : - - - 398 34.0 - - -
87.16/87.27 c Separators : Time Calls Cutoffs DomReds Cuts Conss
87.16/87.27 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
87.16/87.27 c redcost : 0.00 0 0 0 0 0
87.16/87.27 c impliedbounds : 0.00 0 0 0 0 0
87.16/87.27 c intobj : 0.00 0 0 0 0 0
87.16/87.27 c cgmip : 0.00 0 0 0 0 0
87.16/87.27 c gomory : 0.00 0 0 0 0 0
87.16/87.27 c strongcg : 0.00 0 0 0 0 0
87.16/87.27 c cmir : 0.00 0 0 0 0 0
87.16/87.27 c flowcover : 0.00 0 0 0 0 0
87.16/87.27 c clique : 0.00 0 0 0 0 0
87.16/87.27 c zerohalf : 0.00 0 0 0 0 0
87.16/87.27 c mcf : 0.00 0 0 0 0 0
87.16/87.27 c rapidlearning : 0.00 0 0 0 0 0
87.16/87.27 c Pricers : Time Calls Vars
87.16/87.27 c problem variables: 0.00 0 0
87.16/87.27 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
87.16/87.27 c relpscost : 0.00 0 0 0 0 0 0
87.16/87.27 c pscost : 0.00 0 0 0 0 0 0
87.16/87.27 c inference : 0.62 42253 0 0 0 0 84506
87.16/87.27 c mostinf : 0.00 0 0 0 0 0 0
87.16/87.27 c leastinf : 0.00 0 0 0 0 0 0
87.16/87.27 c fullstrong : 0.00 0 0 0 0 0 0
87.16/87.27 c allfullstrong : 0.00 0 0 0 0 0 0
87.16/87.27 c random : 0.00 0 0 0 0 0 0
87.16/87.27 c Primal Heuristics : Time Calls Found
87.16/87.27 c LP solutions : 0.00 - 0
87.16/87.27 c pseudo solutions : 0.00 - 0
87.16/87.27 c trivial : 0.00 1 0
87.16/87.27 c simplerounding : 0.00 0 0
87.16/87.27 c zirounding : 0.00 0 0
87.16/87.27 c rounding : 0.00 0 0
87.16/87.27 c shifting : 0.00 0 0
87.16/87.27 c intshifting : 0.00 0 0
87.16/87.27 c oneopt : 0.00 0 0
87.16/87.27 c twoopt : 0.00 0 0
87.16/87.27 c fixandinfer : 0.00 0 0
87.16/87.27 c feaspump : 0.00 0 0
87.16/87.27 c coefdiving : 0.00 0 0
87.16/87.27 c pscostdiving : 0.00 0 0
87.16/87.27 c fracdiving : 0.00 0 0
87.16/87.27 c veclendiving : 0.00 0 0
87.16/87.27 c intdiving : 0.00 0 0
87.16/87.27 c actconsdiving : 0.00 0 0
87.16/87.27 c objpscostdiving : 0.00 0 0
87.16/87.27 c rootsoldiving : 0.00 0 0
87.16/87.27 c linesearchdiving : 0.00 0 0
87.16/87.27 c guideddiving : 0.00 0 0
87.16/87.27 c octane : 0.00 0 0
87.16/87.27 c rens : 0.00 0 0
87.16/87.27 c rins : 0.00 0 0
87.16/87.27 c localbranching : 0.00 0 0
87.16/87.27 c mutation : 0.00 0 0
87.16/87.27 c crossover : 0.00 0 0
87.16/87.27 c dins : 0.00 0 0
87.16/87.27 c undercover : 0.00 0 0
87.16/87.27 c nlp : 0.00 0 0
87.16/87.27 c trysol : 0.00 0 0
87.16/87.27 c LP : Time Calls Iterations Iter/call Iter/sec
87.16/87.27 c primal LP : 0.00 0 0 0.00 -
87.16/87.27 c dual LP : 0.00 0 0 0.00 -
87.16/87.27 c lex dual LP : 0.00 0 0 0.00 -
87.16/87.27 c barrier LP : 0.00 0 0 0.00 -
87.16/87.27 c diving/probing LP: 0.00 0 0 0.00 -
87.16/87.27 c strong branching : 0.00 0 0 0.00 -
87.16/87.27 c (at root node) : - 0 0 0.00 -
87.16/87.27 c conflict analysis: 0.00 0 0 0.00 -
87.16/87.27 c B&B Tree :
87.16/87.27 c number of runs : 1
87.16/87.27 c nodes : 68062
87.16/87.27 c nodes (total) : 68062
87.16/87.27 c nodes left : 0
87.16/87.27 c max depth : 76
87.16/87.27 c max depth (total): 76
87.16/87.27 c backtracks : 28345 (41.6%)
87.16/87.27 c delayed cutoffs : 16445
87.16/87.27 c repropagations : 95270 (390813 domain reductions, 11579 cutoffs)
87.16/87.27 c avg switch length: 20.47
87.16/87.27 c switching time : 24.36
87.16/87.27 c Solution :
87.16/87.27 c Solutions found : 0 (0 improvements)
87.16/87.27 c Primal Bound : infeasible
87.16/87.27 c Dual Bound : -
87.16/87.27 c Gap : 0.00 %
87.16/87.27 c Root Dual Bound : +0.00000000000000e+00
87.16/87.27 c Root Iterations : 0
87.26/87.32 c Time complete: 87.28.