0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2664894-1276680243.opb>
0.00/0.02 c original problem has 1564 variables (1564 bin, 0 int, 0 impl, 0 cont) and 1616 constraints
0.00/0.02 c problem read
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c presolving settings loaded
0.00/0.04 c presolving:
0.19/0.23 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 11812 impls, 100 clqs
0.39/0.42 c presolving (2 rounds):
0.39/0.42 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.39/0.42 c 11812 implications, 100 cliques
0.39/0.42 c presolved problem has 1564 variables (1564 bin, 0 int, 0 impl, 0 cont) and 1616 constraints
0.39/0.42 c 1 constraints of type <knapsack>
0.39/0.42 c 100 constraints of type <setppc>
0.39/0.42 c 1464 constraints of type <and>
0.39/0.42 c 1 constraints of type <linear>
0.39/0.42 c 50 constraints of type <logicor>
0.39/0.42 c transformed objective value is always integral (scale: 1)
0.39/0.42 c Presolving Time: 0.19
0.39/0.42 c - non default parameters ----------------------------------------------------------------------
0.39/0.42 c # SCIP version 1.2.1.2
0.39/0.42 c
0.39/0.42 c # frequency for displaying node information lines
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 100]
0.39/0.42 c display/freq = 10000
0.39/0.42 c
0.39/0.42 c # maximal time in seconds to run
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.42 c limits/time = 1799.98
0.39/0.42 c
0.39/0.42 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.42 c limits/memory = 1620
0.39/0.42 c
0.39/0.42 c # solving stops, if the given number of solutions were found (-1: no limit)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c limits/solutions = 1
0.39/0.42 c
0.39/0.42 c # maximal number of separation rounds per node (-1: unlimited)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 5]
0.39/0.42 c separating/maxrounds = 1
0.39/0.42 c
0.39/0.42 c # maximal number of separation rounds in the root node (-1: unlimited)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c separating/maxroundsroot = 5
0.39/0.42 c
0.39/0.42 c # should presolving try to simplify inequalities
0.39/0.42 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.42 c constraints/linear/simplifyinequalities = TRUE
0.39/0.42 c
0.39/0.42 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.39/0.42 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.39/0.42 c constraints/knapsack/disaggregation = FALSE
0.39/0.42 c
0.39/0.42 c # should presolving try to simplify knapsacks
0.39/0.42 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.42 c constraints/knapsack/simplifyinequalities = TRUE
0.39/0.42 c
0.39/0.42 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c presolving/probing/maxrounds = 0
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/coefdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/coefdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/coefdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 30]
0.39/0.42 c heuristics/crossover/freq = -1
0.39/0.42 c
0.39/0.42 c # number of nodes added to the contingent of the total nodes
0.39/0.42 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.42 c heuristics/crossover/nodesofs = 750
0.39/0.42 c
0.39/0.42 c # number of nodes without incumbent change that heuristic should wait
0.39/0.42 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.39/0.42 c heuristics/crossover/nwaitingnodes = 100
0.39/0.42 c
0.39/0.42 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.39/0.42 c # [type: real, range: [0,1], default: 0.1]
0.39/0.42 c heuristics/crossover/nodesquot = 0.15
0.39/0.42 c
0.39/0.42 c # minimum percentage of integer variables that have to be fixed
0.39/0.42 c # [type: real, range: [0,1], default: 0.666]
0.39/0.42 c heuristics/crossover/minfixingrate = 0.5
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.42 c heuristics/feaspump/freq = -1
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/feaspump/maxlpiterofs = 2000
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/fracdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/fracdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/fracdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/guideddiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/guideddiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/guideddiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/intdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/intshifting/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/linesearchdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/nlp/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.42 c heuristics/objpscostdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to total iteration number
0.39/0.42 c # [type: real, range: [0,1], default: 0.01]
0.39/0.42 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/oneopt/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/pscostdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/pscostdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c heuristics/rens/freq = -1
0.39/0.42 c
0.39/0.42 c # minimum percentage of integer variables that have to be fixable
0.39/0.42 c # [type: real, range: [0,1], default: 0.5]
0.39/0.42 c heuristics/rens/minfixingrate = 0.3
0.39/0.42 c
0.39/0.42 c # number of nodes added to the contingent of the total nodes
0.39/0.42 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.42 c heuristics/rens/nodesofs = 2000
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.42 c heuristics/rootsoldiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.39/0.42 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/rounding/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/shifting/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/simplerounding/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c heuristics/trivial/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/trysol/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/veclendiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/veclendiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/veclendiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/zirounding/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c separating/cmir/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c separating/flowcover/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c separating/rapidlearning/freq = 0
0.39/0.42 c
0.39/0.42 c -----------------------------------------------------------------------------------------------
0.39/0.42 c start solving
0.39/0.42 c
0.49/0.57 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.57 c 0.3s| 1 | 0 | 408 | - |7165k| 0 | 260 |1564 |1616 |1564 |3080 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1.99/2.00 c 1.6s| 1 | 0 | 624 | - |8122k| 0 | 425 |1564 |1778 |1564 |3087 | 7 | 0 | 0 | 0.000000e+00 | -- | Inf
2.99/3.06 c 2.6s| 1 | 0 | 750 | - |8566k| 0 | 436 |1564 |1778 |1564 |3095 | 15 | 0 | 0 | 0.000000e+00 | -- | Inf
4.58/4.60 c 4.1s| 1 | 0 | 822 | - |8998k| 0 | 433 |1564 |1778 |1564 |3101 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
5.98/6.04 c 5.6s| 1 | 0 | 953 | - |9471k| 0 | 432 |1564 |1778 |1564 |3109 | 29 | 0 | 0 | 0.000000e+00 | -- | Inf
7.70/7.74 c 7.2s| 1 | 0 | 1050 | - | 10M| 0 | 428 |1564 |1778 |1564 |3117 | 37 | 0 | 0 | 0.000000e+00 | -- | Inf
7.70/7.79 c 7.3s| 1 | 0 | 1095 | - | 10M| 0 | 445 |1564 |1778 |1564 |3120 | 40 | 0 | 0 | 0.000000e+00 | -- | Inf
12.59/12.65 c 12.1s| 1 | 2 | 1095 | - | 10M| 0 | 445 |1564 |1778 |1564 |3120 | 40 | 0 | 9 | 0.000000e+00 | -- | Inf
142.34/142.42 c
142.34/142.42 c SCIP Status : problem is solved [infeasible]
142.34/142.42 c Solving Time (sec) : 141.09
142.34/142.42 c Solving Nodes : 635
142.34/142.42 c Primal Bound : +1.00000000000000e+20 (0 solutions)
142.34/142.42 c Dual Bound : +1.00000000000000e+20
142.34/142.42 c Gap : 0.00 %
142.34/142.42 s UNSATISFIABLE
142.34/142.42 c SCIP Status : problem is solved [infeasible]
142.34/142.42 c Solving Time : 141.09
142.34/142.42 c Original Problem :
142.34/142.42 c Problem name : HOME/instance-2664894-1276680243.opb
142.34/142.42 c Variables : 1564 (1564 binary, 0 integer, 0 implicit integer, 0 continuous)
142.34/142.42 c Constraints : 1616 initial, 1616 maximal
142.34/142.42 c Presolved Problem :
142.34/142.42 c Problem name : t_HOME/instance-2664894-1276680243.opb
142.34/142.42 c Variables : 1564 (1564 binary, 0 integer, 0 implicit integer, 0 continuous)
142.34/142.42 c Constraints : 1616 initial, 1787 maximal
142.34/142.42 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
142.34/142.42 c trivial : 0.00 0 0 0 0 0 0 0 0
142.34/142.42 c dualfix : 0.00 0 0 0 0 0 0 0 0
142.34/142.42 c boundshift : 0.00 0 0 0 0 0 0 0 0
142.34/142.42 c inttobinary : 0.00 0 0 0 0 0 0 0 0
142.34/142.42 c implics : 0.00 0 0 0 0 0 0 0 0
142.34/142.42 c probing : 0.00 0 0 0 0 0 0 0 0
142.34/142.42 c knapsack : 0.00 0 0 0 0 0 0 0 0
142.34/142.42 c setppc : 0.00 0 0 0 0 0 0 0 0
142.34/142.42 c and : 0.17 0 0 0 0 0 0 0 0
142.34/142.42 c linear : 0.01 0 0 0 0 0 0 0 0
142.34/142.42 c logicor : 0.00 0 0 0 0 0 0 0 0
142.34/142.42 c root node : - 28 - - 28 - - - -
142.34/142.42 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
142.34/142.42 c integral : 0 0 0 354 0 1 81 0 0 634
142.34/142.42 c knapsack : 1 5 1660 1 0 0 0 0 0 0
142.34/142.42 c setppc : 100 5 1660 1 0 0 1746 0 0 0
142.34/142.42 c and : 1464 564 1660 1 0 1 49432 79477 0 0
142.34/142.42 c linear : 1+ 6 1659 0 0 0 61 0 0 0
142.34/142.42 c logicor : 50+ 5 510 0 0 0 255 0 0 0
142.34/142.42 c countsols : 0 0 0 0 0 0 0 0 0 0
142.34/142.42 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
142.34/142.42 c integral : 53.83 0.00 0.00 53.83 0.00
142.34/142.42 c knapsack : 0.00 0.00 0.00 0.00 0.00
142.34/142.42 c setppc : 0.01 0.00 0.01 0.00 0.00
142.34/142.42 c and : 0.94 0.69 0.25 0.00 0.00
142.34/142.42 c linear : 0.16 0.02 0.14 0.00 0.00
142.34/142.42 c logicor : 0.00 0.00 0.00 0.00 0.00
142.34/142.42 c countsols : 0.00 0.00 0.00 0.00 0.00
142.34/142.42 c Propagators : Time Calls Cutoffs DomReds
142.34/142.42 c vbounds : 0.01 1 0 0
142.34/142.42 c rootredcost : 0.00 0 0 0
142.34/142.42 c pseudoobj : 0.00 0 0 0
142.34/142.42 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
142.34/142.42 c propagation : 0.00 1 1 1 5.0 0 0.0 -
142.34/142.42 c infeasible LP : 0.17 316 47 127 17.8 0 0.0 0
142.34/142.42 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
142.34/142.42 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
142.34/142.42 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
142.34/142.42 c applied globally : - - - 78 21.6 - - -
142.34/142.42 c applied locally : - - - 0 0.0 - - -
142.34/142.42 c Separators : Time Calls Cutoffs DomReds Cuts Conss
142.34/142.42 c cut pool : 0.00 4 - - 17 - (maximal pool size: 451)
142.34/142.42 c redcost : 0.01 564 0 0 0 0
142.34/142.42 c impliedbounds : 0.00 5 0 0 6 0
142.34/142.42 c intobj : 0.00 0 0 0 0 0
142.34/142.42 c cgmip : 0.00 0 0 0 0 0
142.34/142.42 c gomory : 3.50 5 0 0 0 0
142.34/142.42 c strongcg : 2.56 5 0 0 2197 0
142.34/142.42 c cmir : 0.00 0 0 0 0 0
142.34/142.42 c flowcover : 0.00 0 0 0 0 0
142.34/142.42 c clique : 0.05 5 0 0 30 0
142.34/142.42 c zerohalf : 0.00 0 0 0 0 0
142.34/142.42 c mcf : 0.03 2 0 0 12 0
142.34/142.42 c rapidlearning : 0.36 1 0 0 0 162
142.34/142.42 c Pricers : Time Calls Vars
142.34/142.42 c problem variables: 0.00 0 0
142.34/142.42 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
142.34/142.42 c relpscost : 53.83 353 1 81 0 0 634
142.34/142.42 c pscost : 0.00 0 0 0 0 0 0
142.34/142.42 c inference : 0.00 0 0 0 0 0 0
142.34/142.42 c mostinf : 0.00 0 0 0 0 0 0
142.34/142.42 c leastinf : 0.00 0 0 0 0 0 0
142.34/142.42 c fullstrong : 0.00 0 0 0 0 0 0
142.34/142.42 c allfullstrong : 0.00 0 0 0 0 0 0
142.34/142.42 c random : 0.00 0 0 0 0 0 0
142.34/142.42 c Primal Heuristics : Time Calls Found
142.34/142.42 c LP solutions : 0.00 - 0
142.34/142.42 c pseudo solutions : 0.00 - 0
142.34/142.42 c trivial : 0.01 1 0
142.34/142.42 c simplerounding : 0.00 0 0
142.34/142.42 c zirounding : 0.00 0 0
142.34/142.42 c rounding : 0.00 0 0
142.34/142.42 c shifting : 0.00 0 0
142.34/142.42 c intshifting : 0.00 0 0
142.34/142.42 c oneopt : 0.00 0 0
142.34/142.42 c twoopt : 0.00 0 0
142.34/142.42 c fixandinfer : 0.00 0 0
142.34/142.42 c feaspump : 0.00 0 0
142.34/142.42 c coefdiving : 0.00 0 0
142.34/142.42 c pscostdiving : 0.00 0 0
142.34/142.42 c fracdiving : 0.00 0 0
142.34/142.42 c veclendiving : 0.00 0 0
142.34/142.42 c intdiving : 0.00 0 0
142.34/142.42 c actconsdiving : 0.00 0 0
142.34/142.42 c objpscostdiving : 0.00 0 0
142.34/142.42 c rootsoldiving : 0.00 0 0
142.34/142.42 c linesearchdiving : 0.00 0 0
142.34/142.42 c guideddiving : 0.00 0 0
142.34/142.42 c octane : 0.00 0 0
142.34/142.42 c rens : 0.00 0 0
142.34/142.42 c rins : 0.00 0 0
142.34/142.42 c localbranching : 0.00 0 0
142.34/142.42 c mutation : 0.00 0 0
142.34/142.42 c crossover : 0.00 0 0
142.34/142.42 c dins : 0.00 0 0
142.34/142.42 c undercover : 0.00 0 0
142.34/142.42 c nlp : 0.00 0 0
142.34/142.42 c trysol : 0.00 0 0
142.34/142.42 c LP : Time Calls Iterations Iter/call Iter/sec
142.34/142.42 c primal LP : 6.95 0 0 0.00 0.00
142.34/142.42 c dual LP : 70.22 1235 172012 139.28 2449.62
142.34/142.42 c lex dual LP : 0.00 0 0 0.00 -
142.34/142.42 c barrier LP : 0.00 0 0 0.00 -
142.34/142.42 c diving/probing LP: 0.00 0 0 0.00 -
142.34/142.42 c strong branching : 53.76 828 192183 232.11 3574.83
142.34/142.42 c (at root node) : - 9 6633 737.00 -
142.34/142.42 c conflict analysis: 0.00 0 0 0.00 -
142.34/142.42 c B&B Tree :
142.34/142.42 c number of runs : 1
142.34/142.42 c nodes : 635
142.34/142.42 c nodes (total) : 635
142.34/142.42 c nodes left : 0
142.34/142.42 c max depth : 41
142.34/142.42 c max depth (total): 41
142.34/142.42 c backtracks : 120 (18.9%)
142.34/142.42 c delayed cutoffs : 0
142.34/142.42 c repropagations : 121 (1189 domain reductions, 0 cutoffs)
142.34/142.42 c avg switch length: 2.54
142.34/142.42 c switching time : 7.25
142.34/142.42 c Solution :
142.34/142.42 c Solutions found : 0 (0 improvements)
142.34/142.42 c Primal Bound : infeasible
142.34/142.42 c Dual Bound : -
142.34/142.42 c Gap : 0.00 %
142.34/142.42 c Root Dual Bound : +0.00000000000000e+00
142.34/142.42 c Root Iterations : 1095
142.34/142.45 c Time complete: 142.4.