3.99/4.07 c SCIP version 1.1.0.7
3.99/4.07 c LP-Solver SoPlex 1.4.1
3.99/4.07 c user parameter file <scip.set> not found - using default parameters
3.99/4.07 c read problem <HOME/instance-1884257-1245256298.opb>
3.99/4.07 c original problem has 110923 variables (110923 bin, 0 int, 0 impl, 0 cont) and 286428 constraints
5.29/5.33 c No objective function, only one solution is needed.
5.29/5.33 c start presolving problem
5.29/5.33 c presolving:
18.49/18.56 c (round 1) 55653 del vars, 30794 del conss, 8325 chg bounds, 1550 chg sides, 4580 chg coeffs, 0 upgd conss, 7517658 impls, 0 clqs
19.78/19.86 c (round 2) 57229 del vars, 109334 del conss, 8801 chg bounds, 1597 chg sides, 4683 chg coeffs, 0 upgd conss, 7548896 impls, 0 clqs
19.98/20.04 c (round 3) 57750 del vars, 110666 del conss, 8902 chg bounds, 1597 chg sides, 4683 chg coeffs, 0 upgd conss, 7560430 impls, 0 clqs
20.18/20.21 c (round 4) 57897 del vars, 111726 del conss, 8904 chg bounds, 1597 chg sides, 4683 chg coeffs, 0 upgd conss, 7563120 impls, 0 clqs
20.38/20.41 c (round 5) 58315 del vars, 112769 del conss, 8907 chg bounds, 1597 chg sides, 4683 chg coeffs, 0 upgd conss, 7589012 impls, 0 clqs
20.49/20.58 c (round 6) 58374 del vars, 113620 del conss, 8909 chg bounds, 1598 chg sides, 4685 chg coeffs, 0 upgd conss, 7590581 impls, 0 clqs
20.68/20.74 c (round 7) 58457 del vars, 113795 del conss, 8912 chg bounds, 1598 chg sides, 4685 chg coeffs, 0 upgd conss, 7599257 impls, 0 clqs
20.89/20.91 c (round 8) 58526 del vars, 114187 del conss, 8963 chg bounds, 1598 chg sides, 4733 chg coeffs, 0 upgd conss, 7603597 impls, 0 clqs
20.98/21.06 c (round 9) 58560 del vars, 114284 del conss, 8990 chg bounds, 1598 chg sides, 4733 chg coeffs, 0 upgd conss, 7603867 impls, 0 clqs
21.18/21.22 c (round 10) 58777 del vars, 114731 del conss, 9019 chg bounds, 1622 chg sides, 4781 chg coeffs, 0 upgd conss, 7612121 impls, 0 clqs
21.38/21.46 c (round 11) 59843 del vars, 117128 del conss, 9259 chg bounds, 1623 chg sides, 4785 chg coeffs, 0 upgd conss, 7648991 impls, 0 clqs
21.68/21.76 c (round 12) 62742 del vars, 124846 del conss, 10139 chg bounds, 1628 chg sides, 4875 chg coeffs, 0 upgd conss, 7712594 impls, 0 clqs
21.88/22.00 c (round 13) 64258 del vars, 132866 del conss, 10977 chg bounds, 1638 chg sides, 4891 chg coeffs, 0 upgd conss, 7731312 impls, 0 clqs
22.08/22.17 c presolving (14 rounds):
22.08/22.17 c 64511 deleted vars, 134811 deleted constraints, 11273 tightened bounds, 0 added holes, 1643 changed sides, 4907 changed coefficients
22.08/22.17 c 7735975 implications, 0 cliques
22.18/22.22 c presolving detected infeasibility
22.18/22.22 c Presolving Time: 15.81
22.18/22.22 c SATUNSAT-LIN
22.18/22.22 c -----------------------------------------------------------------------------------------------
22.18/22.22 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
22.18/22.22 c # [type: int, range: [-1,2147483647], default: 0]
22.18/22.22 c separating/flowcover/freq = c -1
22.18/22.22 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
22.18/22.22 c # [type: int, range: [-1,2147483647], default: 0]
22.18/22.22 c separating/cmir/freq = c -1
22.18/22.22 c # additional number of allowed LP iterations
22.18/22.22 c # [type: int, range: [0,2147483647], default: 1000]
22.18/22.22 c heuristics/veclendiving/maxlpiterofs = c 1500
22.18/22.22 c # maximal fraction of diving LP iterations compared to node LP iterations
22.18/22.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
22.18/22.22 c heuristics/veclendiving/maxlpiterquot = c 0.075
22.18/22.22 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
22.18/22.22 c # [type: int, range: [-1,2147483647], default: 10]
22.18/22.22 c heuristics/veclendiving/freq = c -1
22.18/22.22 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
22.18/22.22 c # [type: int, range: [-1,2147483647], default: 1]
22.18/22.22 c heuristics/simplerounding/freq = c -1
22.18/22.22 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
22.18/22.22 c # [type: int, range: [-1,2147483647], default: 10]
22.18/22.22 c heuristics/shifting/freq = c -1
22.18/22.22 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
22.18/22.22 c # [type: int, range: [-1,2147483647], default: 1]
22.18/22.22 c heuristics/rounding/freq = c -1
22.18/22.22 c # additional number of allowed LP iterations
22.18/22.22 c # [type: int, range: [0,2147483647], default: 1000]
22.18/22.22 c heuristics/rootsoldiving/maxlpiterofs = c 1500
22.18/22.22 c # maximal fraction of diving LP iterations compared to node LP iterations
22.18/22.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
22.18/22.22 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
22.18/22.22 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
22.18/22.22 c # [type: int, range: [-1,2147483647], default: 20]
22.18/22.22 c heuristics/rootsoldiving/freq = c -1
22.18/22.22 c # number of nodes added to the contingent of the total nodes
22.18/22.22 c # [type: longint, range: [0,9223372036854775807], default: 500]
22.18/22.22 c heuristics/rens/nodesofs = c 2000
22.18/22.22 c # minimum percentage of integer variables that have to be fixable
22.18/22.22 c # [type: real, range: [0,1], default: 0.5]
22.18/22.22 c heuristics/rens/minfixingrate = c 0.3
22.18/22.22 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
22.18/22.22 c # [type: int, range: [-1,2147483647], default: 0]
22.18/22.22 c heuristics/rens/freq = c -1
22.18/22.22 c # additional number of allowed LP iterations
22.18/22.22 c # [type: int, range: [0,2147483647], default: 1000]
22.18/22.22 c heuristics/pscostdiving/maxlpiterofs = c 1500
22.18/22.22 c # maximal fraction of diving LP iterations compared to node LP iterations
22.18/22.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
22.18/22.22 c heuristics/pscostdiving/maxlpiterquot = c 0.075
22.18/22.22 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
22.18/22.22 c # [type: int, range: [-1,2147483647], default: 10]
22.18/22.22 c heuristics/pscostdiving/freq = c -1
22.18/22.22 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
22.18/22.23 c # [type: int, range: [-1,2147483647], default: 1]
22.18/22.23 c heuristics/oneopt/freq = c -1
22.18/22.23 c # additional number of allowed LP iterations
22.18/22.23 c # [type: int, range: [0,2147483647], default: 1000]
22.18/22.23 c heuristics/objpscostdiving/maxlpiterofs = c 1500
22.18/22.23 c # maximal fraction of diving LP iterations compared to total iteration number
22.18/22.23 c # [type: real, range: [0,1], default: 0.01]
22.18/22.23 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
22.18/22.23 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
22.18/22.23 c # [type: int, range: [-1,2147483647], default: 20]
22.18/22.23 c heuristics/objpscostdiving/freq = c -1
22.18/22.23 c # additional number of allowed LP iterations
22.18/22.23 c # [type: int, range: [0,2147483647], default: 1000]
22.18/22.23 c heuristics/linesearchdiving/maxlpiterofs = c 1500
22.18/22.23 c # maximal fraction of diving LP iterations compared to node LP iterations
22.18/22.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
22.18/22.23 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
22.18/22.23 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
22.18/22.23 c # [type: int, range: [-1,2147483647], default: 10]
22.18/22.23 c heuristics/linesearchdiving/freq = c -1
22.18/22.23 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
22.18/22.23 c # [type: int, range: [-1,2147483647], default: 10]
22.18/22.23 c heuristics/intshifting/freq = c -1
22.18/22.23 c # maximal fraction of diving LP iterations compared to node LP iterations
22.18/22.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
22.18/22.23 c heuristics/intdiving/maxlpiterquot = c 0.075
22.18/22.23 c # additional number of allowed LP iterations
22.18/22.23 c # [type: int, range: [0,2147483647], default: 1000]
22.18/22.23 c heuristics/guideddiving/maxlpiterofs = c 1500
22.18/22.23 c # maximal fraction of diving LP iterations compared to node LP iterations
22.18/22.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
22.18/22.23 c heuristics/guideddiving/maxlpiterquot = c 0.075
22.18/22.23 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
22.18/22.23 c # [type: int, range: [-1,2147483647], default: 10]
22.18/22.23 c heuristics/guideddiving/freq = c -1
22.18/22.23 c # additional number of allowed LP iterations
22.18/22.23 c # [type: int, range: [0,2147483647], default: 1000]
22.18/22.23 c heuristics/fracdiving/maxlpiterofs = c 1500
22.18/22.23 c # maximal fraction of diving LP iterations compared to node LP iterations
22.18/22.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
22.18/22.23 c heuristics/fracdiving/maxlpiterquot = c 0.075
22.18/22.23 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
22.18/22.23 c # [type: int, range: [-1,2147483647], default: 10]
22.18/22.23 c heuristics/fracdiving/freq = c -1
22.18/22.23 c # additional number of allowed LP iterations
22.18/22.23 c # [type: int, range: [0,2147483647], default: 1000]
22.18/22.23 c heuristics/feaspump/maxlpiterofs = c 2000
22.18/22.23 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
22.18/22.23 c # [type: int, range: [-1,2147483647], default: 20]
22.18/22.23 c heuristics/feaspump/freq = c -1
22.18/22.23 c # minimum percentage of integer variables that have to be fixed
22.18/22.23 c # [type: real, range: [0,1], default: 0.666]
22.18/22.23 c heuristics/crossover/minfixingrate = c 0.5
22.18/22.23 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
22.18/22.23 c # [type: real, range: [0,1], default: 0.1]
22.18/22.23 c heuristics/crossover/nodesquot = c 0.15
22.18/22.23 c # number of nodes without incumbent change that heuristic should wait
22.18/22.23 c # [type: longint, range: [0,9223372036854775807], default: 200]
22.18/22.23 c heuristics/crossover/nwaitingnodes = c 100
22.18/22.23 c # number of nodes added to the contingent of the total nodes
22.18/22.23 c # [type: longint, range: [0,9223372036854775807], default: 500]
22.18/22.23 c heuristics/crossover/nodesofs = c 750
22.18/22.23 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
22.18/22.23 c # [type: int, range: [-1,2147483647], default: 30]
22.18/22.23 c heuristics/crossover/freq = c -1
22.18/22.23 c # additional number of allowed LP iterations
22.18/22.23 c # [type: int, range: [0,2147483647], default: 1000]
22.18/22.23 c heuristics/coefdiving/maxlpiterofs = c 1500
22.18/22.23 c # maximal fraction of diving LP iterations compared to node LP iterations
22.18/22.23 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
22.18/22.23 c heuristics/coefdiving/maxlpiterquot = c 0.075
22.18/22.23 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
22.18/22.23 c # [type: int, range: [-1,2147483647], default: 10]
22.18/22.23 c heuristics/coefdiving/freq = c -1
22.18/22.23 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
22.18/22.23 c # [type: int, range: [-1,2147483647], default: -1]
22.18/22.23 c presolving/probing/maxrounds = c 0
22.18/22.23 c # should presolving try to simplify knapsacks
22.18/22.23 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
22.18/22.23 c constraints/knapsack/simplifyinequalities = c TRUE
22.18/22.23 c # should disaggregation of knapsack constraints be allowed in preprocessing?
22.18/22.23 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
22.18/22.23 c constraints/knapsack/disaggregation = c FALSE
22.18/22.23 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
22.18/22.23 c # [type: int, range: [-1,2147483647], default: -1]
22.18/22.23 c constraints/knapsack/maxnumcardlift = c 0
22.18/22.23 c # should presolving try to simplify inequalities
22.18/22.23 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
22.18/22.23 c constraints/linear/simplifyinequalities = c TRUE
22.18/22.23 c # maximal number of separation rounds in the root node (-1: unlimited)
22.18/22.23 c # [type: int, range: [-1,2147483647], default: -1]
22.18/22.23 c separating/maxroundsroot = c 5
22.18/22.23 c # maximal number of separation rounds per node (-1: unlimited)
22.18/22.23 c # [type: int, range: [-1,2147483647], default: 5]
22.18/22.23 c separating/maxrounds = c 1
22.18/22.23 c # solving stops, if the given number of solutions were found (-1: no limit)
22.18/22.23 c # [type: int, range: [-1,2147483647], default: -1]
22.18/22.23 c limits/solutions = c 1
22.18/22.23 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
22.18/22.23 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
22.18/22.23 c limits/memory = c 1620
22.18/22.23 c # maximal time in seconds to run
22.18/22.23 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
22.18/22.23 c limits/time = c 1791
22.18/22.23 c # frequency for displaying node information lines
22.18/22.23 c # [type: int, range: [-1,2147483647], default: 100]
22.18/22.23 c display/freq = c 10000
22.18/22.23 c -----------------------------------------------------------------------------------------------
22.18/22.23 c start solving problem
22.18/22.23 c
22.18/22.23 c SCIP Status : problem is solved [infeasible]
22.18/22.23 c Solving Time (sec) : 16.50
22.18/22.23 c Solving Nodes : 0
22.18/22.23 c Primal Bound : +1.00000000000000e+20 (0 solutions)
22.18/22.23 c Dual Bound : -1.00000000000000e+20
22.18/22.23 c Gap : infinite
22.18/22.23 c NODE 0
22.18/22.23 c DUAL BOUND -1e+20
22.18/22.23 c PRIMAL BOUND 1e+20
22.18/22.23 c GAP 1e+20
22.18/22.23 s UNSATISFIABLE
22.18/22.23 c SCIP Status : problem is solved [infeasible]
22.18/22.23 c Solving Time : 16.50
22.18/22.23 c Original Problem :
22.18/22.23 c Problem name : HOME/instance-1884257-1245256298.opb
22.18/22.23 c Variables : 110923 (110923 binary, 0 integer, 0 implicit integer, 0 continuous)
22.18/22.23 c Constraints : 286428 initial, 286428 maximal
22.18/22.23 c Presolved Problem :
22.18/22.23 c Problem name : t_HOME/instance-1884257-1245256298.opb
22.18/22.23 c Variables : 46388 (46388 binary, 0 integer, 0 implicit integer, 0 continuous)
22.18/22.23 c Constraints : 151617 initial, 151617 maximal
22.18/22.23 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
22.18/22.23 c trivial : 0.17 148 0 0 0 0 0 0 0
22.18/22.23 c dualfix : 0.15 8668 0 0 0 0 0 0 0
22.18/22.23 c boundshift : 0.00 0 0 0 0 0 0 0 0
22.18/22.23 c inttobinary : 0.00 0 0 0 0 0 0 0 0
22.18/22.23 c implics : 9.66 0 39751 0 0 0 0 0 0
22.18/22.23 c probing : 0.00 0 0 0 0 0 0 0 0
22.18/22.23 c linear : 5.29 11095 4849 0 11273 0 134811 1643 4907
22.18/22.23 c root node : - 0 - - 0 - - - -
22.18/22.23 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
22.18/22.23 c integral : 0 0 0 0 0 0 0 0 0 0
22.18/22.23 c linear : 151617 0 0 0 0 0 0 0 0 0
22.18/22.23 c countsols : 0 0 0 0 0 0 0 0 0 0
22.18/22.23 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
22.18/22.23 c integral : 0.00 0.00 0.00 0.00 0.00
22.18/22.23 c linear : 0.00 0.00 0.00 0.00 0.00
22.18/22.23 c countsols : 0.00 0.00 0.00 0.00 0.00
22.18/22.23 c Propagators : Time Calls Cutoffs DomReds
22.18/22.23 c pseudoobj : 0.00 0 0 0
22.18/22.23 c rootredcost : 0.00 0 0 0
22.18/22.23 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
22.18/22.23 c propagation : 0.00 0 0 0 0.0 0 0.0 -
22.18/22.23 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
22.18/22.23 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
22.18/22.23 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
22.18/22.23 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
22.18/22.23 c applied globally : - - - 0 0.0 - - -
22.18/22.23 c applied locally : - - - 0 0.0 - - -
22.18/22.23 c Separators : Time Calls Cutoffs DomReds Cuts Conss
22.18/22.23 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
22.18/22.23 c redcost : 0.00 0 0 0 0 0
22.18/22.23 c impliedbounds : 0.00 0 0 0 0 0
22.18/22.23 c intobj : 0.00 0 0 0 0 0
22.18/22.23 c gomory : 0.00 0 0 0 0 0
22.18/22.23 c strongcg : 0.00 0 0 0 0 0
22.18/22.23 c cmir : 0.00 0 0 0 0 0
22.18/22.23 c flowcover : 0.00 0 0 0 0 0
22.18/22.23 c clique : 0.00 0 0 0 0 0
22.18/22.23 c zerohalf : 0.00 0 0 0 0 0
22.18/22.23 c mcf : 0.00 0 0 0 0 0
22.18/22.23 c Pricers : Time Calls Vars
22.18/22.23 c problem variables: 0.00 0 0
22.18/22.23 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
22.18/22.23 c pscost : 0.00 0 0 0 0 0 0
22.18/22.23 c inference : 0.00 0 0 0 0 0 0
22.18/22.23 c mostinf : 0.00 0 0 0 0 0 0
22.18/22.23 c leastinf : 0.00 0 0 0 0 0 0
22.18/22.23 c fullstrong : 0.00 0 0 0 0 0 0
22.18/22.23 c allfullstrong : 0.00 0 0 0 0 0 0
22.18/22.23 c random : 0.00 0 0 0 0 0 0
22.18/22.23 c relpscost : 0.00 0 0 0 0 0 0
22.18/22.23 c Primal Heuristics : Time Calls Found
22.18/22.23 c LP solutions : 0.00 - 0
22.18/22.23 c pseudo solutions : 0.00 - 0
22.18/22.23 c simplerounding : 0.00 0 0
22.18/22.23 c rounding : 0.00 0 0
22.18/22.23 c shifting : 0.00 0 0
22.18/22.23 c intshifting : 0.00 0 0
22.18/22.23 c oneopt : 0.00 0 0
22.18/22.23 c fixandinfer : 0.00 0 0
22.18/22.23 c feaspump : 0.00 0 0
22.18/22.23 c coefdiving : 0.00 0 0
22.18/22.23 c pscostdiving : 0.00 0 0
22.18/22.23 c fracdiving : 0.00 0 0
22.18/22.23 c veclendiving : 0.00 0 0
22.18/22.23 c intdiving : 0.00 0 0
22.18/22.23 c actconsdiving : 0.00 0 0
22.18/22.23 c objpscostdiving : 0.00 0 0
22.18/22.23 c rootsoldiving : 0.00 0 0
22.18/22.23 c linesearchdiving : 0.00 0 0
22.18/22.23 c guideddiving : 0.00 0 0
22.18/22.23 c octane : 0.00 0 0
22.18/22.23 c rens : 0.00 0 0
22.18/22.23 c rins : 0.00 0 0
22.18/22.23 c localbranching : 0.00 0 0
22.18/22.23 c mutation : 0.00 0 0
22.18/22.23 c crossover : 0.00 0 0
22.18/22.23 c dins : 0.00 0 0
22.18/22.23 c LP : Time Calls Iterations Iter/call Iter/sec
22.18/22.23 c primal LP : 0.00 0 0 0.00 -
22.18/22.23 c dual LP : 0.00 0 0 0.00 -
22.18/22.23 c barrier LP : 0.00 0 0 0.00 -
22.18/22.23 c diving/probing LP: 0.00 0 0 0.00 -
22.18/22.23 c strong branching : 0.00 0 0 0.00 -
22.18/22.23 c (at root node) : - 0 0 0.00 -
22.18/22.23 c conflict analysis: 0.00 0 0 0.00 -
22.18/22.23 c B&B Tree :
22.18/22.23 c number of runs : 1
22.18/22.23 c nodes : 0
22.18/22.23 c nodes (total) : 0
22.18/22.23 c nodes left : 1
22.18/22.23 c max depth : -1
22.18/22.23 c max depth (total): -1
22.18/22.23 c backtracks : 0 (0.0%)
22.18/22.23 c delayed cutoffs : 0
22.18/22.23 c repropagations : 0 (0 domain reductions, 0 cutoffs)
22.18/22.23 c avg switch length: 0.00
22.18/22.23 c switching time : 0.00
22.18/22.23 c Solution :
22.18/22.23 c Solutions found : 0 (0 improvements)
22.18/22.23 c Primal Bound : infeasible
22.18/22.23 c Dual Bound : -
22.18/22.23 c Gap : infinite
22.18/22.23 c Root Dual Bound : -
23.09/23.12 c Time complete: 23.11.