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-2664330-1276276215.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.01
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.04 c
0.00/0.04 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.04 c 0.0s| 1 | 2 | 0 | - | 633k| 0 | - | 169 | 73 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
2.69/2.79 c 2.5s| 10000 | 6338 | 0 | 0.0 |5927k| 66 | - | 169 |3022 | 0 | 0 | 0 |3128 | 0 | 0.000000e+00 | -- | Inf
7.29/7.39 c 6.9s| 20000 | 11445 | 0 | 0.0 | 10M| 66 | - | 169 |3616 | 0 | 0 | 0 |6995 | 0 | 0.000000e+00 | -- | Inf
14.69/14.74 c 14.0s| 30000 | 14072 | 0 | 0.0 | 14M| 66 | - | 169 |6316 | 0 | 0 | 0 | 12k| 0 | 0.000000e+00 | -- | Inf
25.79/25.82 c 24.8s| 40000 | 14817 | 0 | 0.0 | 17M| 66 | - | 169 |5489 | 0 | 0 | 0 | 20k| 0 | 0.000000e+00 | -- | Inf
37.68/37.75 c 36.4s| 50000 | 14785 | 0 | 0.0 | 20M| 66 | - | 169 |7724 | 0 | 0 | 0 | 28k| 0 | 0.000000e+00 | -- | Inf
54.89/54.98 c 53.4s| 60000 | 12919 | 0 | 0.0 | 21M| 66 | - | 169 | 11k| 0 | 0 | 0 | 37k| 0 | 0.000000e+00 | -- | Inf
85.67/85.74 c 83.7s| 70000 | 5808 | 0 | 0.0 | 16M| 66 | - | 169 | 14k| 0 | 0 | 0 | 50k| 0 | 0.000000e+00 | -- | Inf
105.67/105.76 c
105.67/105.76 c SCIP Status : problem is solved [infeasible]
105.67/105.76 c Solving Time (sec) : 103.47
105.67/105.76 c Solving Nodes : 74835
105.67/105.76 c Primal Bound : +1.00000000000000e+20 (0 solutions)
105.67/105.76 c Dual Bound : +1.00000000000000e+20
105.67/105.76 c Gap : 0.00 %
105.67/105.76 s UNSATISFIABLE
105.67/105.76 c SCIP Status : problem is solved [infeasible]
105.67/105.76 c Solving Time : 103.47
105.67/105.76 c Original Problem :
105.67/105.76 c Problem name : HOME/instance-2664330-1276276215.opb
105.67/105.76 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
105.67/105.76 c Constraints : 101 initial, 101 maximal
105.67/105.76 c Presolved Problem :
105.67/105.76 c Problem name : t_HOME/instance-2664330-1276276215.opb
105.67/105.76 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
105.67/105.76 c Constraints : 73 initial, 17707 maximal
105.67/105.76 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
105.67/105.76 c trivial : 0.00 0 0 0 0 0 0 0 0
105.67/105.76 c dualfix : 0.00 0 0 0 0 0 0 0 0
105.67/105.76 c boundshift : 0.00 0 0 0 0 0 0 0 0
105.67/105.76 c inttobinary : 0.00 0 0 0 0 0 0 0 0
105.67/105.76 c implics : 0.00 0 0 0 0 0 0 0 0
105.67/105.76 c probing : 0.00 0 0 0 0 0 0 0 0
105.67/105.76 c knapsack : 0.00 0 0 0 0 0 0 0 0
105.67/105.76 c setppc : 0.00 0 0 0 0 0 0 0 0
105.67/105.76 c linear : 0.01 0 0 0 0 0 28 0 0
105.67/105.76 c logicor : 0.00 0 0 0 0 0 0 0 0
105.67/105.76 c root node : - 0 - - 0 - - - -
105.67/105.76 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
105.67/105.76 c integral : 0 0 0 0 0 0 0 0 0 0
105.67/105.76 c knapsack : 1 0 263164 0 46962 5624 956047 0 0 0
105.67/105.76 c setppc : 68 0 257540 0 46962 35303 589784 0 0 0
105.67/105.76 c logicor : 4+ 0 107142 0 27122 491 42563 0 0 0
105.67/105.76 c countsols : 0 0 0 0 46962 0 0 0 0 0
105.67/105.76 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
105.67/105.76 c integral : 0.00 0.00 0.00 0.00 0.00
105.67/105.76 c knapsack : 15.67 0.00 15.37 0.00 0.30
105.67/105.76 c setppc : 5.14 0.00 4.53 0.00 0.61
105.67/105.76 c logicor : 39.37 0.00 39.32 0.00 0.05
105.67/105.76 c countsols : 0.05 0.00 0.00 0.00 0.05
105.67/105.76 c Propagators : Time Calls Cutoffs DomReds
105.67/105.76 c vbounds : 0.14 1 0 0
105.67/105.76 c rootredcost : 0.14 0 0 0
105.67/105.76 c pseudoobj : 0.12 0 0 0
105.67/105.76 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
105.67/105.76 c propagation : 2.29 41418 41406 190633 17.5 1065 21.5 -
105.67/105.76 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
105.67/105.76 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
105.67/105.76 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
105.67/105.76 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
105.67/105.76 c applied globally : - - - 58218 13.4 - - -
105.67/105.76 c applied locally : - - - 267 34.1 - - -
105.67/105.76 c Separators : Time Calls Cutoffs DomReds Cuts Conss
105.67/105.76 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
105.67/105.76 c redcost : 0.00 0 0 0 0 0
105.67/105.76 c impliedbounds : 0.00 0 0 0 0 0
105.67/105.76 c intobj : 0.00 0 0 0 0 0
105.67/105.76 c cgmip : 0.00 0 0 0 0 0
105.67/105.76 c gomory : 0.00 0 0 0 0 0
105.67/105.76 c strongcg : 0.00 0 0 0 0 0
105.67/105.76 c cmir : 0.00 0 0 0 0 0
105.67/105.76 c flowcover : 0.00 0 0 0 0 0
105.67/105.76 c clique : 0.00 0 0 0 0 0
105.67/105.76 c zerohalf : 0.00 0 0 0 0 0
105.67/105.76 c mcf : 0.00 0 0 0 0 0
105.67/105.76 c rapidlearning : 0.00 0 0 0 0 0
105.67/105.76 c Pricers : Time Calls Vars
105.67/105.76 c problem variables: 0.00 0 0
105.67/105.76 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
105.67/105.76 c relpscost : 0.00 0 0 0 0 0 0
105.67/105.76 c pscost : 0.00 0 0 0 0 0 0
105.67/105.76 c inference : 0.62 46962 0 0 0 0 93924
105.67/105.76 c mostinf : 0.00 0 0 0 0 0 0
105.67/105.76 c leastinf : 0.00 0 0 0 0 0 0
105.67/105.76 c fullstrong : 0.00 0 0 0 0 0 0
105.67/105.76 c allfullstrong : 0.00 0 0 0 0 0 0
105.67/105.76 c random : 0.00 0 0 0 0 0 0
105.67/105.76 c Primal Heuristics : Time Calls Found
105.67/105.76 c LP solutions : 0.00 - 0
105.67/105.76 c pseudo solutions : 0.00 - 0
105.67/105.76 c trivial : 0.00 1 0
105.67/105.76 c simplerounding : 0.00 0 0
105.67/105.76 c zirounding : 0.00 0 0
105.67/105.76 c rounding : 0.00 0 0
105.67/105.76 c shifting : 0.00 0 0
105.67/105.76 c intshifting : 0.00 0 0
105.67/105.76 c oneopt : 0.00 0 0
105.67/105.76 c twoopt : 0.00 0 0
105.67/105.76 c fixandinfer : 0.00 0 0
105.67/105.76 c feaspump : 0.00 0 0
105.67/105.76 c coefdiving : 0.00 0 0
105.67/105.76 c pscostdiving : 0.00 0 0
105.67/105.76 c fracdiving : 0.00 0 0
105.67/105.76 c veclendiving : 0.00 0 0
105.67/105.76 c intdiving : 0.00 0 0
105.67/105.76 c actconsdiving : 0.00 0 0
105.67/105.76 c objpscostdiving : 0.00 0 0
105.67/105.76 c rootsoldiving : 0.00 0 0
105.67/105.76 c linesearchdiving : 0.00 0 0
105.67/105.76 c guideddiving : 0.00 0 0
105.67/105.76 c octane : 0.00 0 0
105.67/105.76 c rens : 0.00 0 0
105.67/105.76 c rins : 0.00 0 0
105.67/105.76 c localbranching : 0.00 0 0
105.67/105.76 c mutation : 0.00 0 0
105.67/105.76 c crossover : 0.00 0 0
105.67/105.76 c dins : 0.00 0 0
105.67/105.76 c undercover : 0.00 0 0
105.67/105.76 c nlp : 0.00 0 0
105.67/105.76 c trysol : 0.00 0 0
105.67/105.76 c LP : Time Calls Iterations Iter/call Iter/sec
105.67/105.76 c primal LP : 0.00 0 0 0.00 -
105.67/105.76 c dual LP : 0.00 0 0 0.00 -
105.67/105.76 c lex dual LP : 0.00 0 0 0.00 -
105.67/105.76 c barrier LP : 0.00 0 0 0.00 -
105.67/105.76 c diving/probing LP: 0.00 0 0 0.00 -
105.67/105.76 c strong branching : 0.00 0 0 0.00 -
105.67/105.76 c (at root node) : - 0 0 0.00 -
105.67/105.76 c conflict analysis: 0.00 0 0 0.00 -
105.67/105.76 c B&B Tree :
105.67/105.76 c number of runs : 1
105.67/105.76 c nodes : 74835
105.67/105.76 c nodes (total) : 74835
105.67/105.76 c nodes left : 0
105.67/105.76 c max depth : 66
105.67/105.76 c max depth (total): 66
105.67/105.76 c backtracks : 30589 (40.9%)
105.67/105.76 c delayed cutoffs : 19090
105.67/105.76 c repropagations : 101285 (454134 domain reductions, 13545 cutoffs)
105.67/105.76 c avg switch length: 19.13
105.67/105.76 c switching time : 29.67
105.67/105.76 c Solution :
105.67/105.76 c Solutions found : 0 (0 improvements)
105.67/105.76 c Primal Bound : infeasible
105.67/105.76 c Dual Bound : -
105.67/105.76 c Gap : 0.00 %
105.67/105.76 c Root Dual Bound : +0.00000000000000e+00
105.67/105.76 c Root Iterations : 0
105.77/105.81 c Time complete: 105.77.