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-2664404-1276292862.opb>
0.00/0.05 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.00/0.05 c problem read
0.00/0.05 c No objective function, only one solution is needed.
0.00/0.05 c presolving settings loaded
0.00/0.05 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.07 c presolving:
0.09/0.12 c (round 1) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.09/0.13 c (round 2) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.09/0.14 c presolving (3 rounds):
0.09/0.14 c 0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.14 c 242 implications, 22 cliques
0.09/0.14 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2564 constraints
0.09/0.14 c 1 constraints of type <knapsack>
0.09/0.14 c 22 constraints of type <setppc>
0.09/0.14 c 2541 constraints of type <logicor>
0.09/0.14 c transformed objective value is always integral (scale: 1)
0.09/0.14 c Presolving Time: 0.07
0.09/0.14 c - non default parameters ----------------------------------------------------------------------
0.09/0.14 c # SCIP version 1.2.1.2
0.09/0.14 c
0.09/0.14 c # frequency for displaying node information lines
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.14 c display/freq = 10000
0.09/0.14 c
0.09/0.14 c # maximal time in seconds to run
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.14 c limits/time = 1799.95
0.09/0.14 c
0.09/0.14 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.14 c limits/memory = 1620
0.09/0.14 c
0.09/0.14 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.14 c limits/solutions = 1
0.09/0.14 c
0.09/0.14 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c lp/solvefreq = -1
0.09/0.14 c
0.09/0.14 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.14 c separating/maxrounds = 1
0.09/0.14 c
0.09/0.14 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.14 c separating/maxroundsroot = 5
0.09/0.14 c
0.09/0.14 c # should presolving try to simplify inequalities
0.09/0.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.14 c constraints/linear/simplifyinequalities = TRUE
0.09/0.14 c
0.09/0.14 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.14 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.14 c constraints/knapsack/disaggregation = FALSE
0.09/0.14 c
0.09/0.14 c # should presolving try to simplify knapsacks
0.09/0.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.14 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.14 c
0.09/0.15 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c presolving/probing/maxrounds = 0
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/coefdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.15 c heuristics/crossover/freq = -1
0.09/0.15 c
0.09/0.15 c # number of nodes added to the contingent of the total nodes
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15 c heuristics/crossover/nodesofs = 750
0.09/0.15 c
0.09/0.15 c # number of nodes without incumbent change that heuristic should wait
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.15 c heuristics/crossover/nwaitingnodes = 100
0.09/0.15 c
0.09/0.15 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.15 c # [type: real, range: [0,1], default: 0.1]
0.09/0.15 c heuristics/crossover/nodesquot = 0.15
0.09/0.15 c
0.09/0.15 c # minimum percentage of integer variables that have to be fixed
0.09/0.15 c # [type: real, range: [0,1], default: 0.666]
0.09/0.15 c heuristics/crossover/minfixingrate = 0.5
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/feaspump/freq = -1
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/fracdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/guideddiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/intshifting/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/linesearchdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/nlp/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/objpscostdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.15 c # [type: real, range: [0,1], default: 0.01]
0.09/0.15 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/oneopt/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/pscostdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/rens/freq = -1
0.09/0.15 c
0.09/0.15 c # minimum percentage of integer variables that have to be fixable
0.09/0.15 c # [type: real, range: [0,1], default: 0.5]
0.09/0.15 c heuristics/rens/minfixingrate = 0.3
0.09/0.15 c
0.09/0.15 c # number of nodes added to the contingent of the total nodes
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15 c heuristics/rens/nodesofs = 2000
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/rootsoldiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.15 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/rounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/shifting/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/simplerounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/trivial/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/trysol/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/veclendiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/zirounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c separating/cmir/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c separating/flowcover/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c separating/rapidlearning/freq = 0
0.09/0.15 c
0.09/0.15 c -----------------------------------------------------------------------------------------------
0.09/0.15 c start solving
0.09/0.15 c
0.09/0.15 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.15 c 0.1s| 1 | 2 | 0 | - |2396k| 0 | - | 231 |2564 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
4.89/4.95 c 4.6s| 10000 | 7018 | 0 | 0.0 |7475k| 106 | - | 231 |5205 | 0 | 0 | 0 |3827 | 0 | 0.000000e+00 | -- | Inf
11.39/11.46 c 10.9s| 20000 | 13499 | 0 | 0.0 | 12M| 106 | - | 231 |6003 | 0 | 0 | 0 |7907 | 0 | 0.000000e+00 | -- | Inf
19.09/19.10 c 18.3s| 30000 | 19731 | 0 | 0.0 | 17M| 106 | - | 231 |7177 | 0 | 0 | 0 | 12k| 0 | 0.000000e+00 | -- | Inf
30.88/30.97 c 29.9s| 40000 | 23813 | 0 | 0.0 | 22M| 106 | - | 231 |9360 | 0 | 0 | 0 | 19k| 0 | 0.000000e+00 | -- | Inf
48.38/48.44 c 47.0s| 50000 | 26142 | 0 | 0.0 | 27M| 106 | - | 231 | 11k| 0 | 0 | 0 | 29k| 0 | 0.000000e+00 | -- | Inf
65.88/65.95 c 64.2s| 60000 | 29744 | 0 | 0.0 | 31M| 106 | - | 231 |9950 | 0 | 0 | 0 | 36k| 0 | 0.000000e+00 | -- | Inf
84.16/84.29 c 82.2s| 70000 | 32841 | 0 | 0.0 | 36M| 106 | - | 231 | 10k| 0 | 0 | 0 | 45k| 0 | 0.000000e+00 | -- | Inf
105.56/105.68 c 103s| 80000 | 35037 | 0 | 0.0 | 41M| 106 | - | 231 | 12k| 0 | 0 | 0 | 54k| 0 | 0.000000e+00 | -- | Inf
129.55/129.63 c 127s| 90000 | 36683 | 0 | 0.0 | 46M| 106 | - | 231 | 13k| 0 | 0 | 0 | 64k| 0 | 0.000000e+00 | -- | Inf
156.14/156.21 c 153s|100000 | 37689 | 0 | 0.0 | 50M| 106 | - | 231 | 14k| 0 | 0 | 0 | 74k| 0 | 0.000000e+00 | -- | Inf
187.72/187.85 c 184s|110000 | 37412 | 0 | 0.0 | 54M| 106 | - | 231 | 16k| 0 | 0 | 0 | 86k| 0 | 0.000000e+00 | -- | Inf
226.00/226.14 c 222s|120000 | 36138 | 0 | 0.0 | 56M| 106 | - | 231 | 18k| 0 | 0 | 0 | 101k| 0 | 0.000000e+00 | -- | Inf
273.80/273.99 c 269s|130000 | 32908 | 0 | 0.0 | 56M| 106 | - | 231 | 15k| 0 | 0 | 0 | 116k| 0 | 0.000000e+00 | -- | Inf
321.88/322.03 c 317s|140000 | 29364 | 0 | 0.0 | 57M| 106 | - | 231 | 17k| 0 | 0 | 0 | 132k| 0 | 0.000000e+00 | -- | Inf
377.76/377.93 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
377.76/377.93 c 372s|150000 | 24452 | 0 | 0.0 | 55M| 106 | - | 231 | 21k| 0 | 0 | 0 | 149k| 0 | 0.000000e+00 | -- | Inf
441.13/441.30 c 435s|160000 | 18943 | 0 | 0.0 | 50M| 106 | - | 231 | 25k| 0 | 0 | 0 | 167k| 0 | 0.000000e+00 | -- | Inf
519.20/519.49 c 513s|170000 | 10717 | 0 | 0.0 | 38M| 106 | - | 231 | 28k| 0 | 0 | 0 | 189k| 0 | 0.000000e+00 | -- | Inf
605.26/605.57 c
605.26/605.57 c SCIP Status : problem is solved [infeasible]
605.26/605.57 c Solving Time (sec) : 598.23
605.26/605.57 c Solving Nodes : 178828
605.26/605.57 c Primal Bound : +1.00000000000000e+20 (0 solutions)
605.26/605.57 c Dual Bound : +1.00000000000000e+20
605.26/605.57 c Gap : 0.00 %
605.26/605.57 s UNSATISFIABLE
605.26/605.57 c SCIP Status : problem is solved [infeasible]
605.26/605.57 c Solving Time : 598.23
605.26/605.57 c Original Problem :
605.26/605.57 c Problem name : HOME/instance-2664404-1276292862.opb
605.26/605.57 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
605.26/605.57 c Constraints : 2707 initial, 2707 maximal
605.26/605.57 c Presolved Problem :
605.26/605.57 c Problem name : t_HOME/instance-2664404-1276292862.opb
605.26/605.57 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
605.26/605.57 c Constraints : 2564 initial, 39577 maximal
605.26/605.57 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
605.26/605.57 c trivial : 0.00 0 0 0 0 0 0 0 0
605.26/605.57 c dualfix : 0.00 0 0 0 0 0 0 0 0
605.26/605.57 c boundshift : 0.00 0 0 0 0 0 0 0 0
605.26/605.57 c inttobinary : 0.00 0 0 0 0 0 0 0 0
605.26/605.57 c implics : 0.00 0 0 0 0 0 0 0 0
605.26/605.57 c probing : 0.00 0 0 0 0 0 0 0 0
605.26/605.57 c knapsack : 0.00 0 0 0 0 0 0 0 0
605.26/605.57 c setppc : 0.00 0 0 0 0 0 0 0 0
605.26/605.57 c linear : 0.02 0 0 0 0 0 143 0 0
605.26/605.57 c logicor : 0.03 0 0 0 0 0 0 0 0
605.26/605.57 c root node : - 0 - - 0 - - - -
605.26/605.57 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
605.26/605.57 c integral : 0 0 0 0 0 0 0 0 0 0
605.26/605.57 c knapsack : 1 0 798439 0 114120 29447 2912356 0 0 0
605.26/605.57 c setppc : 22 0 774855 0 114120 37507 963829 0 0 0
605.26/605.57 c logicor : 2541+ 0 553761 0 114120 29108 2349831 0 0 0
605.26/605.57 c countsols : 0 0 0 0 114120 0 0 0 0 0
605.26/605.57 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
605.26/605.57 c integral : 0.00 0.00 0.00 0.00 0.00
605.26/605.57 c knapsack : 18.08 0.00 17.40 0.00 0.68
605.26/605.57 c setppc : 10.19 0.00 9.33 0.00 0.86
605.26/605.57 c logicor : 309.69 0.00 292.60 0.00 17.09
605.26/605.57 c countsols : 0.04 0.00 0.00 0.00 0.04
605.26/605.57 c Propagators : Time Calls Cutoffs DomReds
605.26/605.57 c vbounds : 0.42 1 0 0
605.26/605.57 c rootredcost : 0.33 0 0 0
605.26/605.57 c pseudoobj : 0.36 0 0 0
605.26/605.57 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
605.26/605.57 c propagation : 5.24 96062 96017 409682 15.2 1702 19.8 -
605.26/605.57 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
605.26/605.57 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
605.26/605.57 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
605.26/605.57 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
605.26/605.57 c applied globally : - - - 213504 12.7 - - -
605.26/605.57 c applied locally : - - - 315 36.2 - - -
605.26/605.57 c Separators : Time Calls Cutoffs DomReds Cuts Conss
605.26/605.57 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
605.26/605.57 c redcost : 0.00 0 0 0 0 0
605.26/605.57 c impliedbounds : 0.00 0 0 0 0 0
605.26/605.57 c intobj : 0.00 0 0 0 0 0
605.26/605.57 c cgmip : 0.00 0 0 0 0 0
605.26/605.57 c gomory : 0.00 0 0 0 0 0
605.26/605.57 c strongcg : 0.00 0 0 0 0 0
605.26/605.57 c cmir : 0.00 0 0 0 0 0
605.26/605.57 c flowcover : 0.00 0 0 0 0 0
605.26/605.57 c clique : 0.00 0 0 0 0 0
605.26/605.57 c zerohalf : 0.00 0 0 0 0 0
605.26/605.57 c mcf : 0.00 0 0 0 0 0
605.26/605.57 c rapidlearning : 0.00 0 0 0 0 0
605.26/605.57 c Pricers : Time Calls Vars
605.26/605.57 c problem variables: 0.00 0 0
605.26/605.57 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
605.26/605.57 c relpscost : 0.00 0 0 0 0 0 0
605.26/605.57 c pscost : 0.00 0 0 0 0 0 0
605.26/605.57 c inference : 3.15 114120 0 0 0 0 228240
605.26/605.57 c mostinf : 0.00 0 0 0 0 0 0
605.26/605.57 c leastinf : 0.00 0 0 0 0 0 0
605.26/605.57 c fullstrong : 0.00 0 0 0 0 0 0
605.26/605.57 c allfullstrong : 0.00 0 0 0 0 0 0
605.26/605.57 c random : 0.00 0 0 0 0 0 0
605.26/605.57 c Primal Heuristics : Time Calls Found
605.26/605.57 c LP solutions : 0.00 - 0
605.26/605.57 c pseudo solutions : 0.00 - 0
605.26/605.57 c trivial : 0.00 1 0
605.26/605.57 c simplerounding : 0.00 0 0
605.26/605.57 c zirounding : 0.00 0 0
605.26/605.57 c rounding : 0.00 0 0
605.26/605.57 c shifting : 0.00 0 0
605.26/605.57 c intshifting : 0.00 0 0
605.26/605.57 c oneopt : 0.00 0 0
605.26/605.57 c twoopt : 0.00 0 0
605.26/605.57 c fixandinfer : 0.00 0 0
605.26/605.57 c feaspump : 0.00 0 0
605.26/605.57 c coefdiving : 0.00 0 0
605.26/605.57 c pscostdiving : 0.00 0 0
605.26/605.57 c fracdiving : 0.00 0 0
605.26/605.57 c veclendiving : 0.00 0 0
605.26/605.57 c intdiving : 0.00 0 0
605.26/605.57 c actconsdiving : 0.00 0 0
605.26/605.57 c objpscostdiving : 0.00 0 0
605.26/605.57 c rootsoldiving : 0.00 0 0
605.26/605.57 c linesearchdiving : 0.00 0 0
605.26/605.57 c guideddiving : 0.00 0 0
605.26/605.57 c octane : 0.00 0 0
605.26/605.57 c rens : 0.00 0 0
605.26/605.57 c rins : 0.00 0 0
605.26/605.57 c localbranching : 0.00 0 0
605.26/605.57 c mutation : 0.00 0 0
605.26/605.57 c crossover : 0.00 0 0
605.26/605.57 c dins : 0.00 0 0
605.26/605.57 c undercover : 0.00 0 0
605.26/605.57 c nlp : 0.00 0 0
605.26/605.57 c trysol : 0.00 0 0
605.26/605.57 c LP : Time Calls Iterations Iter/call Iter/sec
605.26/605.57 c primal LP : 0.00 0 0 0.00 -
605.26/605.57 c dual LP : 0.00 0 0 0.00 -
605.26/605.57 c lex dual LP : 0.00 0 0 0.00 -
605.26/605.57 c barrier LP : 0.00 0 0 0.00 -
605.26/605.57 c diving/probing LP: 0.00 0 0 0.00 -
605.26/605.57 c strong branching : 0.00 0 0 0.00 -
605.26/605.57 c (at root node) : - 0 0 0.00 -
605.26/605.57 c conflict analysis: 0.00 0 0 0.00 -
605.26/605.57 c B&B Tree :
605.26/605.57 c number of runs : 1
605.26/605.57 c nodes : 178828
605.26/605.57 c nodes (total) : 178828
605.26/605.57 c nodes left : 0
605.26/605.57 c max depth : 106
605.26/605.57 c max depth (total): 106
605.26/605.57 c backtracks : 73367 (41.0%)
605.26/605.57 c delayed cutoffs : 49413
605.26/605.57 c repropagations : 269749 (1827716 domain reductions, 31354 cutoffs)
605.26/605.57 c avg switch length: 20.44
605.26/605.57 c switching time : 169.55
605.26/605.57 c Solution :
605.26/605.57 c Solutions found : 0 (0 improvements)
605.26/605.57 c Primal Bound : infeasible
605.26/605.57 c Dual Bound : -
605.26/605.57 c Gap : 0.00 %
605.26/605.57 c Root Dual Bound : +0.00000000000000e+00
605.26/605.57 c Root Iterations : 0
605.37/605.67 c Time complete: 605.44.