0.00/0.05 c SCIP version 1.1.0.7
0.00/0.05 c LP-Solver Clp 1.8.2
0.00/0.05 c user parameter file <scip.set> not found - using default parameters
0.00/0.05 c read problem <HOME/instance-1868309-1245120464.opb>
0.00/0.05 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.05/0.06 c No objective function, only one solution is needed.
0.05/0.06 c start presolving problem
0.05/0.06 c presolving:
0.09/0.10 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.11 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.12 c presolving (3 rounds):
0.09/0.12 c 0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.12 c 242 implications, 22 cliques
0.09/0.12 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2564 constraints
0.09/0.12 c 1 constraints of type <knapsack>
0.09/0.12 c 22 constraints of type <setppc>
0.09/0.12 c 2541 constraints of type <logicor>
0.09/0.12 c transformed objective value is always integral (scale: 1)
0.09/0.12 c Presolving Time: 0.05
0.09/0.12 c SATUNSAT-LIN
0.09/0.12 c -----------------------------------------------------------------------------------------------
0.09/0.12 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c separating/flowcover/freq = c -1
0.09/0.12 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c separating/cmir/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/veclendiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/veclendiving/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c heuristics/simplerounding/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/shifting/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c heuristics/rounding/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.12 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.09/0.12 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12 c heuristics/rootsoldiving/freq = c -1
0.09/0.12 c # number of nodes added to the contingent of the total nodes
0.09/0.12 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.12 c heuristics/rens/nodesofs = c 2000
0.09/0.12 c # minimum percentage of integer variables that have to be fixable
0.09/0.12 c # [type: real, range: [0,1], default: 0.5]
0.09/0.12 c heuristics/rens/minfixingrate = c 0.3
0.09/0.12 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c heuristics/rens/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/pscostdiving/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c heuristics/oneopt/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.12 c # [type: real, range: [0,1], default: 0.01]
0.09/0.12 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.09/0.12 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12 c heuristics/objpscostdiving/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/linesearchdiving/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/intshifting/freq = c -1
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/intdiving/maxlpiterquot = c 0.075
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/guideddiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/guideddiving/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/fracdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/fracdiving/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/feaspump/maxlpiterofs = c 2000
0.09/0.12 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12 c heuristics/feaspump/freq = c -1
0.09/0.12 c # minimum percentage of integer variables that have to be fixed
0.09/0.12 c # [type: real, range: [0,1], default: 0.666]
0.09/0.12 c heuristics/crossover/minfixingrate = c 0.5
0.09/0.12 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.12 c # [type: real, range: [0,1], default: 0.1]
0.09/0.12 c heuristics/crossover/nodesquot = c 0.15
0.09/0.12 c # number of nodes without incumbent change that heuristic should wait
0.09/0.12 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.12 c heuristics/crossover/nwaitingnodes = c 100
0.09/0.12 c # number of nodes added to the contingent of the total nodes
0.09/0.12 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.12 c heuristics/crossover/nodesofs = c 750
0.09/0.12 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.12 c heuristics/crossover/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/coefdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/coefdiving/freq = c -1
0.09/0.12 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c presolving/probing/maxrounds = c 0
0.09/0.12 c # should presolving try to simplify knapsacks
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/knapsack/simplifyinequalities = c TRUE
0.09/0.12 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.12 c constraints/knapsack/disaggregation = c FALSE
0.09/0.12 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c constraints/knapsack/maxnumcardlift = c 0
0.09/0.12 c # should presolving try to simplify inequalities
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/linear/simplifyinequalities = c TRUE
0.09/0.12 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c separating/maxroundsroot = c 5
0.09/0.12 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.12 c separating/maxrounds = c 1
0.09/0.12 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c limits/solutions = c 1
0.09/0.12 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/memory = c 1620
0.09/0.12 c # maximal time in seconds to run
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/time = c 1791
0.09/0.12 c # frequency for displaying node information lines
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.12 c display/freq = c 10000
0.09/0.12 c -----------------------------------------------------------------------------------------------
0.09/0.12 c start solving problem
0.09/0.12 c
0.09/0.14 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.14 c 0.1s| 1 | 0 | 64 |3513k| 0 | 35 | 231 |2564 |2564 | 231 |2564 | 0 | 0 | 0 | 1.100000e+01 | -- | Inf
0.19/0.28 c 0.2s| 1 | 0 | 78 |3780k| 0 | 36 | 231 |2564 |2564 | 231 |2573 | 9 | 0 | 0 | 1.100000e+01 | -- | Inf
0.39/0.49 c 0.4s| 1 | 0 | 104 |4266k| 0 | 48 | 231 |2564 |2564 | 231 |2577 | 13 | 0 | 0 | 1.100000e+01 | -- | Inf
0.79/0.88 c 0.8s| 1 | 0 | 136 |4341k| 0 | 49 | 231 |2564 |2564 | 231 |2578 | 14 | 0 | 0 | 1.100000e+01 | -- | Inf
1.19/1.27 c 1.2s| 1 | 0 | 189 |4528k| 0 | 44 | 231 |2564 |2564 | 231 |2581 | 17 | 0 | 0 | 1.100000e+01 | -- | Inf
1.59/1.63 c 1.5s| 1 | 0 | 241 |4617k| 0 | 45 | 231 |2564 |2564 | 231 |2583 | 19 | 0 | 0 | 1.100000e+01 | -- | Inf
2.59/2.65 c 2.5s| 1 | 2 | 241 |4618k| 0 | 45 | 231 |2564 |2564 | 231 |2583 | 19 | 0 | 21 | 1.100000e+01 | -- | Inf
133.74/133.86 c 133s| 10000 | 1207 |341214 |7963k| 52 | - | 231 |3388 |1107 | 231 |2568 | 19 |1659 |2338 | 1.400000e+01 | -- | Inf
217.90/218.08 c 217s| 20000 | 1755 |610121 |9499k| 53 | - | 231 |3430 | 827 | 0 | 0 | 19 |3543 |2628 | 1.500000e+01 | -- | Inf
309.48/309.62 c 308s| 30000 | 2327 |899109 | 10M| 58 | - | 231 |3072 |1259 | 231 |2568 | 19 |4695 |3100 | 1.500000e+01 | -- | Inf
403.14/403.32 c 401s| 40000 | 2636 | 1182k| 12M| 58 | 22 | 231 |3192 |1450 | 231 |2568 | 19 |5962 |3758 | 1.500000e+01 | -- | Inf
485.71/485.97 c 483s| 50000 | 2549 | 1429k| 12M| 58 | 33 | 231 |3506 |1389 | 231 |2568 | 19 |7573 |4233 | 1.600000e+01 | -- | Inf
566.79/567.09 c 564s| 60000 | 2433 | 1670k| 12M| 58 | - | 231 |3513 | 886 | 231 |2568 | 19 |9127 |4600 | 1.600000e+01 | -- | Inf
645.95/646.25 c 642s| 70000 | 2010 | 1886k| 11M| 58 | - | 231 |3238 |1218 | 231 |2568 | 19 | 10k|5052 | 1.700000e+01 | -- | Inf
724.63/724.95 c 720s| 80000 | 1680 | 2096k| 10M| 58 | - | 231 |3143 |1428 | 231 |2568 | 19 | 11k|5462 | 1.700000e+01 | -- | Inf
793.50/793.85 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
793.50/793.85 c 789s| 90000 | 757 | 2262k|8492k| 58 | - | 231 |3558 |1034 | 231 |2568 | 19 | 12k|5769 | 1.800000e+01 | -- | Inf
827.78/828.13 c
827.78/828.13 c SCIP Status : problem is solved [infeasible]
827.78/828.13 c Solving Time (sec) : 822.94
827.78/828.13 c Solving Nodes : 95056
827.78/828.13 c Primal Bound : +1.00000000000000e+20 (0 solutions)
827.78/828.13 c Dual Bound : +1.00000000000000e+20
827.78/828.13 c Gap : 0.00 %
827.78/828.13 c NODE 95056
827.78/828.13 c DUAL BOUND 1e+20
827.78/828.13 c PRIMAL BOUND 1e+20
827.78/828.13 c GAP 0
827.78/828.13 s UNSATISFIABLE
827.78/828.13 c SCIP Status : problem is solved [infeasible]
827.78/828.13 c Solving Time : 822.94
827.78/828.13 c Original Problem :
827.78/828.13 c Problem name : HOME/instance-1868309-1245120464.opb
827.78/828.13 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
827.78/828.13 c Constraints : 2707 initial, 2707 maximal
827.78/828.13 c Presolved Problem :
827.78/828.13 c Problem name : t_HOME/instance-1868309-1245120464.opb
827.78/828.13 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
827.78/828.13 c Constraints : 2564 initial, 3613 maximal
827.78/828.13 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
827.78/828.13 c trivial : 0.00 0 0 0 0 0 0 0 0
827.78/828.13 c dualfix : 0.00 0 0 0 0 0 0 0 0
827.78/828.13 c boundshift : 0.00 0 0 0 0 0 0 0 0
827.78/828.13 c inttobinary : 0.00 0 0 0 0 0 0 0 0
827.78/828.13 c implics : 0.00 0 0 0 0 0 0 0 0
827.78/828.13 c probing : 0.00 0 0 0 0 0 0 0 0
827.78/828.13 c knapsack : 0.00 0 0 0 0 0 0 0 0
827.78/828.13 c setppc : 0.00 0 0 0 0 0 0 0 0
827.78/828.13 c linear : 0.02 0 0 0 0 0 143 0 0
827.78/828.13 c logicor : 0.03 0 0 0 0 0 0 0 0
827.78/828.13 c root node : - 1 - - 1 - - - -
827.78/828.13 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
827.78/828.13 c integral : 0 0 0 49499 0 367 2397 0 0 95410
827.78/828.13 c knapsack : 1 5 208968 0 0 1097 272407 0 0 0
827.78/828.13 c setppc : 22 5 208268 0 0 3076 471564 0 0 0
827.78/828.13 c logicor : 2541+ 5 180961 0 0 1157 628643 0 0 0
827.78/828.13 c countsols : 0 0 0 0 0 0 0 0 0 0
827.78/828.13 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
827.78/828.13 c integral : 82.31 0.00 0.00 82.31 0.00
827.78/828.13 c knapsack : 1.09 0.00 1.09 0.00 0.00
827.78/828.13 c setppc : 2.55 0.00 2.55 0.00 0.00
827.78/828.13 c logicor : 14.56 0.00 14.56 0.00 0.00
827.78/828.13 c countsols : 0.00 0.00 0.00 0.00 0.00
827.78/828.13 c Propagators : Time Calls Cutoffs DomReds
827.78/828.13 c rootredcost : 0.15 0 0 0
827.78/828.13 c pseudoobj : 2.94 209376 1 0
827.78/828.13 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
827.78/828.13 c propagation : 0.35 5330 5330 28822 15.9 50 14.3 -
827.78/828.13 c infeasible LP : 1.48 42008 0 0 0.0 0 0.0 0
827.78/828.13 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
827.78/828.13 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
827.78/828.13 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
827.78/828.13 c applied globally : - - - 13658 14.3 - - -
827.78/828.13 c applied locally : - - - 6 32.5 - - -
827.78/828.13 c Separators : Time Calls Cutoffs DomReds Cuts Conss
827.78/828.13 c cut pool : 0.01 4 - - 15 - (maximal pool size: 375)
827.78/828.13 c redcost : 0.85 48145 0 0 0 0
827.78/828.13 c impliedbounds : 0.00 5 0 0 0 0
827.78/828.13 c intobj : 0.00 0 0 0 0 0
827.78/828.13 c gomory : 0.79 5 0 0 1164 0
827.78/828.13 c strongcg : 0.57 5 0 0 1946 0
827.78/828.13 c cmir : 0.00 0 0 0 0 0
827.78/828.13 c flowcover : 0.00 0 0 0 0 0
827.78/828.13 c clique : 0.00 5 0 0 0 0
827.78/828.13 c zerohalf : 0.00 0 0 0 0 0
827.78/828.13 c mcf : 0.01 1 0 0 0 0
827.78/828.13 c Pricers : Time Calls Vars
827.78/828.13 c problem variables: 0.00 0 0
827.78/828.13 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
827.78/828.13 c relpscost : 82.21 49499 367 2397 0 0 95410
827.78/828.13 c pscost : 0.00 0 0 0 0 0 0
827.78/828.13 c inference : 0.00 0 0 0 0 0 0
827.78/828.13 c mostinf : 0.00 0 0 0 0 0 0
827.78/828.13 c leastinf : 0.00 0 0 0 0 0 0
827.78/828.13 c fullstrong : 0.00 0 0 0 0 0 0
827.78/828.13 c allfullstrong : 0.00 0 0 0 0 0 0
827.78/828.13 c random : 0.00 0 0 0 0 0 0
827.78/828.13 c Primal Heuristics : Time Calls Found
827.78/828.13 c LP solutions : 0.00 - 0
827.78/828.13 c pseudo solutions : 0.00 - 0
827.78/828.13 c simplerounding : 0.00 0 0
827.78/828.13 c rounding : 0.00 0 0
827.78/828.13 c shifting : 0.00 0 0
827.78/828.13 c intshifting : 0.00 0 0
827.78/828.13 c oneopt : 0.00 0 0
827.78/828.13 c fixandinfer : 0.00 0 0
827.78/828.13 c feaspump : 0.00 0 0
827.78/828.13 c coefdiving : 0.00 0 0
827.78/828.13 c pscostdiving : 0.00 0 0
827.78/828.13 c fracdiving : 0.00 0 0
827.78/828.13 c veclendiving : 0.00 0 0
827.78/828.13 c intdiving : 0.00 0 0
827.78/828.13 c actconsdiving : 0.00 0 0
827.78/828.13 c objpscostdiving : 0.00 0 0
827.78/828.13 c rootsoldiving : 0.00 0 0
827.78/828.13 c linesearchdiving : 0.00 0 0
827.78/828.13 c guideddiving : 0.00 0 0
827.78/828.13 c octane : 0.00 0 0
827.78/828.13 c rens : 0.00 0 0
827.78/828.13 c rins : 0.00 0 0
827.78/828.13 c localbranching : 0.00 0 0
827.78/828.13 c mutation : 0.00 0 0
827.78/828.13 c crossover : 0.00 0 0
827.78/828.13 c dins : 0.00 0 0
827.78/828.13 c LP : Time Calls Iterations Iter/call Iter/sec
827.78/828.13 c primal LP : 0.01 0 0 0.00 0.00
827.78/828.13 c dual LP : 668.51 91362 2332383 25.53 3488.93
827.78/828.13 c barrier LP : 0.00 0 0 0.00 -
827.78/828.13 c diving/probing LP: 0.00 0 0 0.00 -
827.78/828.13 c strong branching : 80.50 6062 326085 53.79 4050.75
827.78/828.13 c (at root node) : - 21 3297 157.00 -
827.78/828.13 c conflict analysis: 0.00 0 0 0.00 -
827.78/828.13 c B&B Tree :
827.78/828.13 c number of runs : 1
827.78/828.13 c nodes : 95056
827.78/828.13 c nodes (total) : 95056
827.78/828.13 c nodes left : 0
827.78/828.13 c max depth : 58
827.78/828.13 c max depth (total): 58
827.78/828.13 c backtracks : 11251 (11.8%)
827.78/828.13 c delayed cutoffs : 355
827.78/828.13 c repropagations : 12519 (34886 domain reductions, 355 cutoffs)
827.78/828.13 c avg switch length: 5.46
827.78/828.13 c switching time : 16.31
827.78/828.13 c Solution :
827.78/828.13 c Solutions found : 0 (0 improvements)
827.78/828.13 c Primal Bound : infeasible
827.78/828.13 c Dual Bound : -
827.78/828.13 c Gap : 0.00 %
827.78/828.13 c Root Dual Bound : +1.10000000000000e+01
827.78/828.15 c Time complete: 827.83.