0.49/0.52 c SCIP version 1.1.0.7
0.49/0.52 c LP-Solver SoPlex 1.4.1
0.49/0.52 c user parameter file <scip.set> not found - using default parameters
0.49/0.52 c read problem <HOME/instance-3739652-1338756707.opb>
0.49/0.52 c original problem has 24684 variables (24684 bin, 0 int, 0 impl, 0 cont) and 81656 constraints
0.59/0.68 c No objective function, only one solution is needed.
0.59/0.68 c start presolving problem
0.59/0.68 c presolving:
2.59/2.60 c (round 1) 5837 del vars, 16178 del conss, 4321 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 4875510 impls, 0 clqs
3.19/3.27 c (round 2) 12194 del vars, 41995 del conss, 10250 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 4917603 impls, 0 clqs
3.38/3.42 c (round 3) 14858 del vars, 52577 del conss, 12013 chg bounds, 28 chg sides, 30 chg coeffs, 0 upgd conss, 4934119 impls, 0 clqs
3.38/3.49 c (round 4) 16042 del vars, 56828 del conss, 12890 chg bounds, 66 chg sides, 86 chg coeffs, 0 upgd conss, 4944903 impls, 0 clqs
3.49/3.55 c (round 5) 17350 del vars, 60734 del conss, 13841 chg bounds, 80 chg sides, 107 chg coeffs, 0 upgd conss, 4958510 impls, 0 clqs
3.49/3.58 c (round 6) 17966 del vars, 63011 del conss, 14265 chg bounds, 87 chg sides, 113 chg coeffs, 0 upgd conss, 4964063 impls, 0 clqs
3.59/3.61 c (round 7) 18273 del vars, 64170 del conss, 14461 chg bounds, 87 chg sides, 113 chg coeffs, 0 upgd conss, 4967318 impls, 0 clqs
3.59/3.63 c (round 8) 18457 del vars, 64910 del conss, 14581 chg bounds, 87 chg sides, 113 chg coeffs, 0 upgd conss, 4969411 impls, 0 clqs
3.59/3.64 c (round 9) 18568 del vars, 65379 del conss, 14653 chg bounds, 87 chg sides, 113 chg coeffs, 0 upgd conss, 4970653 impls, 0 clqs
3.59/3.66 c (round 10) 18604 del vars, 65568 del conss, 14675 chg bounds, 87 chg sides, 113 chg coeffs, 0 upgd conss, 4970927 impls, 0 clqs
3.59/3.66 c (round 11) 18605 del vars, 65585 del conss, 14675 chg bounds, 87 chg sides, 113 chg coeffs, 0 upgd conss, 4970937 impls, 0 clqs
3.69/3.75 c (round 12) 18605 del vars, 65586 del conss, 14675 chg bounds, 87 chg sides, 113 chg coeffs, 16070 upgd conss, 4970937 impls, 0 clqs
3.79/3.85 c (round 13) 18605 del vars, 65586 del conss, 14675 chg bounds, 95 chg sides, 157 chg coeffs, 16070 upgd conss, 4970937 impls, 0 clqs
3.79/3.87 c presolving (14 rounds):
3.79/3.87 c 18605 deleted vars, 65586 deleted constraints, 14675 tightened bounds, 0 added holes, 96 changed sides, 197 changed coefficients
3.79/3.87 c 4970937 implications, 0 cliques
3.79/3.87 c presolved problem has 6079 variables (6079 bin, 0 int, 0 impl, 0 cont) and 16070 constraints
3.79/3.87 c 340 constraints of type <knapsack>
3.79/3.87 c 15730 constraints of type <logicor>
3.79/3.87 c transformed objective value is always integral (scale: 1)
3.79/3.87 c Presolving Time: 3.04
3.79/3.87 c SATUNSAT-LIN
3.79/3.87 c -----------------------------------------------------------------------------------------------
3.79/3.87 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
3.79/3.87 c # [type: int, range: [-1,2147483647], default: 0]
3.79/3.87 c separating/flowcover/freq = c -1
3.79/3.87 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
3.79/3.87 c # [type: int, range: [-1,2147483647], default: 0]
3.79/3.87 c separating/cmir/freq = c -1
3.79/3.87 c # additional number of allowed LP iterations
3.79/3.87 c # [type: int, range: [0,2147483647], default: 1000]
3.79/3.87 c heuristics/veclendiving/maxlpiterofs = c 1500
3.79/3.87 c # maximal fraction of diving LP iterations compared to node LP iterations
3.79/3.87 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.79/3.87 c heuristics/veclendiving/maxlpiterquot = c 0.075
3.79/3.87 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
3.79/3.87 c # [type: int, range: [-1,2147483647], default: 10]
3.79/3.87 c heuristics/veclendiving/freq = c -1
3.79/3.87 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
3.79/3.87 c # [type: int, range: [-1,2147483647], default: 1]
3.79/3.87 c heuristics/simplerounding/freq = c -1
3.79/3.87 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
3.79/3.87 c # [type: int, range: [-1,2147483647], default: 10]
3.79/3.87 c heuristics/shifting/freq = c -1
3.79/3.87 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
3.79/3.87 c # [type: int, range: [-1,2147483647], default: 1]
3.79/3.87 c heuristics/rounding/freq = c -1
3.79/3.87 c # additional number of allowed LP iterations
3.79/3.87 c # [type: int, range: [0,2147483647], default: 1000]
3.79/3.87 c heuristics/rootsoldiving/maxlpiterofs = c 1500
3.79/3.87 c # maximal fraction of diving LP iterations compared to node LP iterations
3.79/3.87 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
3.79/3.87 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
3.79/3.87 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
3.79/3.87 c # [type: int, range: [-1,2147483647], default: 20]
3.79/3.87 c heuristics/rootsoldiving/freq = c -1
3.79/3.87 c # number of nodes added to the contingent of the total nodes
3.79/3.87 c # [type: longint, range: [0,9223372036854775807], default: 500]
3.79/3.87 c heuristics/rens/nodesofs = c 2000
3.79/3.87 c # minimum percentage of integer variables that have to be fixable
3.79/3.87 c # [type: real, range: [0,1], default: 0.5]
3.79/3.87 c heuristics/rens/minfixingrate = c 0.3
3.79/3.87 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
3.79/3.87 c # [type: int, range: [-1,2147483647], default: 0]
3.79/3.87 c heuristics/rens/freq = c -1
3.79/3.87 c # additional number of allowed LP iterations
3.79/3.87 c # [type: int, range: [0,2147483647], default: 1000]
3.79/3.87 c heuristics/pscostdiving/maxlpiterofs = c 1500
3.79/3.87 c # maximal fraction of diving LP iterations compared to node LP iterations
3.79/3.87 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.79/3.87 c heuristics/pscostdiving/maxlpiterquot = c 0.075
3.79/3.87 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
3.79/3.87 c # [type: int, range: [-1,2147483647], default: 10]
3.79/3.87 c heuristics/pscostdiving/freq = c -1
3.79/3.87 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
3.79/3.87 c # [type: int, range: [-1,2147483647], default: 1]
3.79/3.87 c heuristics/oneopt/freq = c -1
3.79/3.87 c # additional number of allowed LP iterations
3.79/3.87 c # [type: int, range: [0,2147483647], default: 1000]
3.79/3.87 c heuristics/objpscostdiving/maxlpiterofs = c 1500
3.79/3.87 c # maximal fraction of diving LP iterations compared to total iteration number
3.79/3.87 c # [type: real, range: [0,1], default: 0.01]
3.79/3.87 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
3.79/3.87 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
3.79/3.87 c # [type: int, range: [-1,2147483647], default: 20]
3.79/3.87 c heuristics/objpscostdiving/freq = c -1
3.79/3.87 c # additional number of allowed LP iterations
3.79/3.87 c # [type: int, range: [0,2147483647], default: 1000]
3.79/3.87 c heuristics/linesearchdiving/maxlpiterofs = c 1500
3.79/3.87 c # maximal fraction of diving LP iterations compared to node LP iterations
3.79/3.87 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.79/3.87 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
3.79/3.87 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
3.79/3.87 c # [type: int, range: [-1,2147483647], default: 10]
3.79/3.87 c heuristics/linesearchdiving/freq = c -1
3.79/3.87 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
3.79/3.87 c # [type: int, range: [-1,2147483647], default: 10]
3.79/3.87 c heuristics/intshifting/freq = c -1
3.79/3.87 c # maximal fraction of diving LP iterations compared to node LP iterations
3.79/3.87 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.79/3.87 c heuristics/intdiving/maxlpiterquot = c 0.075
3.79/3.87 c # additional number of allowed LP iterations
3.79/3.87 c # [type: int, range: [0,2147483647], default: 1000]
3.79/3.87 c heuristics/guideddiving/maxlpiterofs = c 1500
3.79/3.87 c # maximal fraction of diving LP iterations compared to node LP iterations
3.79/3.87 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.79/3.87 c heuristics/guideddiving/maxlpiterquot = c 0.075
3.79/3.87 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
3.79/3.87 c # [type: int, range: [-1,2147483647], default: 10]
3.79/3.87 c heuristics/guideddiving/freq = c -1
3.79/3.87 c # additional number of allowed LP iterations
3.79/3.87 c # [type: int, range: [0,2147483647], default: 1000]
3.79/3.87 c heuristics/fracdiving/maxlpiterofs = c 1500
3.79/3.87 c # maximal fraction of diving LP iterations compared to node LP iterations
3.79/3.87 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.79/3.87 c heuristics/fracdiving/maxlpiterquot = c 0.075
3.79/3.87 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
3.79/3.87 c # [type: int, range: [-1,2147483647], default: 10]
3.79/3.87 c heuristics/fracdiving/freq = c -1
3.79/3.87 c # additional number of allowed LP iterations
3.79/3.87 c # [type: int, range: [0,2147483647], default: 1000]
3.79/3.87 c heuristics/feaspump/maxlpiterofs = c 2000
3.79/3.87 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
3.79/3.87 c # [type: int, range: [-1,2147483647], default: 20]
3.79/3.87 c heuristics/feaspump/freq = c -1
3.79/3.87 c # minimum percentage of integer variables that have to be fixed
3.79/3.87 c # [type: real, range: [0,1], default: 0.666]
3.79/3.87 c heuristics/crossover/minfixingrate = c 0.5
3.79/3.87 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
3.79/3.87 c # [type: real, range: [0,1], default: 0.1]
3.79/3.87 c heuristics/crossover/nodesquot = c 0.15
3.79/3.87 c # number of nodes without incumbent change that heuristic should wait
3.79/3.87 c # [type: longint, range: [0,9223372036854775807], default: 200]
3.79/3.87 c heuristics/crossover/nwaitingnodes = c 100
3.79/3.87 c # number of nodes added to the contingent of the total nodes
3.79/3.87 c # [type: longint, range: [0,9223372036854775807], default: 500]
3.79/3.87 c heuristics/crossover/nodesofs = c 750
3.79/3.87 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
3.79/3.87 c # [type: int, range: [-1,2147483647], default: 30]
3.79/3.87 c heuristics/crossover/freq = c -1
3.79/3.87 c # additional number of allowed LP iterations
3.79/3.87 c # [type: int, range: [0,2147483647], default: 1000]
3.79/3.87 c heuristics/coefdiving/maxlpiterofs = c 1500
3.79/3.87 c # maximal fraction of diving LP iterations compared to node LP iterations
3.79/3.87 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
3.79/3.87 c heuristics/coefdiving/maxlpiterquot = c 0.075
3.79/3.87 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
3.79/3.87 c # [type: int, range: [-1,2147483647], default: 10]
3.79/3.87 c heuristics/coefdiving/freq = c -1
3.79/3.87 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
3.79/3.87 c # [type: int, range: [-1,2147483647], default: -1]
3.79/3.87 c presolving/probing/maxrounds = c 0
3.79/3.87 c # should presolving try to simplify knapsacks
3.79/3.87 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
3.79/3.87 c constraints/knapsack/simplifyinequalities = c TRUE
3.79/3.87 c # should disaggregation of knapsack constraints be allowed in preprocessing?
3.79/3.87 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
3.79/3.87 c constraints/knapsack/disaggregation = c FALSE
3.79/3.87 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
3.79/3.87 c # [type: int, range: [-1,2147483647], default: -1]
3.79/3.87 c constraints/knapsack/maxnumcardlift = c 0
3.79/3.87 c # should presolving try to simplify inequalities
3.79/3.88 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
3.79/3.88 c constraints/linear/simplifyinequalities = c TRUE
3.79/3.88 c # maximal number of separation rounds in the root node (-1: unlimited)
3.79/3.88 c # [type: int, range: [-1,2147483647], default: -1]
3.79/3.88 c separating/maxroundsroot = c 5
3.79/3.88 c # maximal number of separation rounds per node (-1: unlimited)
3.79/3.88 c # [type: int, range: [-1,2147483647], default: 5]
3.79/3.88 c separating/maxrounds = c 1
3.79/3.88 c # solving stops, if the given number of solutions were found (-1: no limit)
3.79/3.88 c # [type: int, range: [-1,2147483647], default: -1]
3.79/3.88 c limits/solutions = c 1
3.79/3.88 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
3.79/3.88 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
3.79/3.88 c limits/memory = c 13950
3.79/3.88 c # maximal time in seconds to run
3.79/3.88 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
3.79/3.88 c limits/time = c 1791
3.79/3.88 c # frequency for displaying node information lines
3.79/3.88 c # [type: int, range: [-1,2147483647], default: 100]
3.79/3.88 c display/freq = c 10000
3.79/3.88 c -----------------------------------------------------------------------------------------------
3.79/3.88 c start solving problem
3.79/3.88 c
25.29/25.38 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
25.29/25.38 c 24.6s| 1 | 0 | 15826 | 117M| 0 | - |6079 | 16k| 16k|6079 | 16k| 0 | 0 | 0 | -- | -- | 0.00%
25.29/25.38 c 24.6s| 1 | 0 | 15826 | 117M| 0 | - |6079 | 16k| 16k|6079 | 16k| 0 | 0 | 0 | -- | -- | 0.00%
25.29/25.38 c
25.29/25.38 c SCIP Status : problem is solved [infeasible]
25.29/25.38 c Solving Time (sec) : 24.61
25.29/25.38 c Solving Nodes : 1
25.29/25.38 c Primal Bound : +1.00000000000000e+20 (0 solutions)
25.29/25.38 c Dual Bound : +1.00000000000000e+20
25.29/25.38 c Gap : 0.00 %
25.29/25.38 c NODE 1
25.29/25.38 c DUAL BOUND 1e+20
25.29/25.38 c PRIMAL BOUND 1e+20
25.29/25.38 c GAP 0
25.29/25.38 s UNSATISFIABLE
25.29/25.38 c SCIP Status : problem is solved [infeasible]
25.29/25.38 c Solving Time : 24.61
25.29/25.38 c Original Problem :
25.29/25.38 c Problem name : HOME/instance-3739652-1338756707.opb
25.29/25.38 c Variables : 24684 (24684 binary, 0 integer, 0 implicit integer, 0 continuous)
25.29/25.38 c Constraints : 81656 initial, 81656 maximal
25.29/25.38 c Presolved Problem :
25.29/25.38 c Problem name : t_HOME/instance-3739652-1338756707.opb
25.29/25.38 c Variables : 6079 (6079 binary, 0 integer, 0 implicit integer, 0 continuous)
25.29/25.38 c Constraints : 16070 initial, 16070 maximal
25.29/25.38 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
25.29/25.38 c trivial : 0.01 653 0 0 0 0 0 0 0
25.29/25.38 c dualfix : 0.01 7 0 0 0 0 0 0 0
25.29/25.38 c boundshift : 0.00 0 0 0 0 0 0 0 0
25.29/25.38 c inttobinary : 0.00 0 0 0 0 0 0 0 0
25.29/25.38 c implics : 0.03 0 0 0 0 0 0 0 0
25.29/25.38 c probing : 0.00 0 0 0 0 0 0 0 0
25.29/25.38 c knapsack : 0.08 0 0 0 0 0 0 9 84
25.29/25.38 c linear : 2.79 14022 3923 0 14675 0 65586 87 113
25.29/25.38 c logicor : 0.03 0 0 0 0 0 0 0 0
25.29/25.38 c root node : - 0 - - 0 - - - -
25.29/25.38 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
25.29/25.38 c integral : 0 0 0 0 0 0 0 0 0 0
25.29/25.38 c knapsack : 340 0 1 0 0 0 0 0 0 0
25.29/25.38 c logicor : 15730 0 1 0 0 0 0 0 0 0
25.29/25.38 c countsols : 0 0 0 0 0 0 0 0 0 0
25.29/25.38 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
25.29/25.38 c integral : 0.00 0.00 0.00 0.00 0.00
25.29/25.38 c knapsack : 0.00 0.00 0.00 0.00 0.00
25.29/25.38 c logicor : 0.01 0.00 0.01 0.00 0.00
25.29/25.38 c countsols : 0.00 0.00 0.00 0.00 0.00
25.29/25.38 c Propagators : Time Calls Cutoffs DomReds
25.29/25.38 c rootredcost : 0.00 0 0 0
25.29/25.38 c pseudoobj : 0.00 2 1 0
25.29/25.38 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
25.29/25.38 c propagation : 0.00 0 0 0 0.0 0 0.0 -
25.29/25.38 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
25.29/25.38 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
25.29/25.38 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
25.29/25.38 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
25.29/25.38 c applied globally : - - - 0 0.0 - - -
25.29/25.38 c applied locally : - - - 0 0.0 - - -
25.29/25.38 c Separators : Time Calls Cutoffs DomReds Cuts Conss
25.29/25.38 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
25.29/25.38 c redcost : 0.00 0 0 0 0 0
25.29/25.38 c impliedbounds : 0.00 0 0 0 0 0
25.29/25.38 c intobj : 0.00 0 0 0 0 0
25.29/25.38 c gomory : 0.00 0 0 0 0 0
25.29/25.38 c strongcg : 0.00 0 0 0 0 0
25.29/25.38 c cmir : 0.00 0 0 0 0 0
25.29/25.38 c flowcover : 0.00 0 0 0 0 0
25.29/25.38 c clique : 0.00 0 0 0 0 0
25.29/25.38 c zerohalf : 0.00 0 0 0 0 0
25.29/25.38 c mcf : 0.00 0 0 0 0 0
25.29/25.38 c Pricers : Time Calls Vars
25.29/25.38 c problem variables: 0.00 0 0
25.29/25.38 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
25.29/25.38 c pscost : 0.00 0 0 0 0 0 0
25.29/25.38 c inference : 0.00 0 0 0 0 0 0
25.29/25.38 c mostinf : 0.00 0 0 0 0 0 0
25.29/25.38 c leastinf : 0.00 0 0 0 0 0 0
25.29/25.38 c fullstrong : 0.00 0 0 0 0 0 0
25.29/25.38 c allfullstrong : 0.00 0 0 0 0 0 0
25.29/25.38 c random : 0.00 0 0 0 0 0 0
25.29/25.38 c relpscost : 0.00 0 0 0 0 0 0
25.29/25.38 c Primal Heuristics : Time Calls Found
25.29/25.38 c LP solutions : 0.00 - 0
25.29/25.38 c pseudo solutions : 0.00 - 0
25.29/25.38 c simplerounding : 0.00 0 0
25.29/25.38 c rounding : 0.00 0 0
25.29/25.38 c shifting : 0.00 0 0
25.29/25.38 c intshifting : 0.00 0 0
25.29/25.38 c oneopt : 0.00 0 0
25.29/25.38 c fixandinfer : 0.00 0 0
25.29/25.38 c feaspump : 0.00 0 0
25.29/25.38 c coefdiving : 0.00 0 0
25.29/25.38 c pscostdiving : 0.00 0 0
25.29/25.38 c fracdiving : 0.00 0 0
25.29/25.38 c veclendiving : 0.00 0 0
25.29/25.38 c intdiving : 0.00 0 0
25.29/25.38 c actconsdiving : 0.00 0 0
25.29/25.38 c objpscostdiving : 0.00 0 0
25.29/25.38 c rootsoldiving : 0.00 0 0
25.29/25.38 c linesearchdiving : 0.00 0 0
25.29/25.38 c guideddiving : 0.00 0 0
25.29/25.38 c octane : 0.00 0 0
25.29/25.38 c rens : 0.00 0 0
25.29/25.38 c rins : 0.00 0 0
25.29/25.38 c localbranching : 0.00 0 0
25.29/25.38 c mutation : 0.00 0 0
25.29/25.38 c crossover : 0.00 0 0
25.29/25.38 c dins : 0.00 0 0
25.29/25.38 c LP : Time Calls Iterations Iter/call Iter/sec
25.29/25.38 c primal LP : 0.00 0 0 0.00 -
25.29/25.38 c dual LP : 21.41 1 15826 15826.00 739.19
25.29/25.38 c barrier LP : 0.00 0 0 0.00 -
25.29/25.38 c diving/probing LP: 0.00 0 0 0.00 -
25.29/25.38 c strong branching : 0.00 0 0 0.00 -
25.29/25.38 c (at root node) : - 0 0 0.00 -
25.29/25.38 c conflict analysis: 0.00 0 0 0.00 -
25.29/25.38 c B&B Tree :
25.29/25.38 c number of runs : 1
25.29/25.38 c nodes : 1
25.29/25.38 c nodes (total) : 1
25.29/25.38 c nodes left : 0
25.29/25.38 c max depth : 0
25.29/25.38 c max depth (total): 0
25.29/25.38 c backtracks : 0 (0.0%)
25.29/25.38 c delayed cutoffs : 0
25.29/25.38 c repropagations : 0 (0 domain reductions, 0 cutoffs)
25.29/25.38 c avg switch length: 2.00
25.29/25.38 c switching time : 0.00
25.29/25.38 c Solution :
25.29/25.38 c Solutions found : 0 (0 improvements)
25.29/25.38 c Primal Bound : infeasible
25.29/25.38 c Dual Bound : -
25.29/25.38 c Gap : 0.00 %
25.29/25.38 c Root Dual Bound : -
25.48/25.51 c Time complete: 25.5.