0.00/0.06 c SCIP version 1.1.0.7
0.00/0.06 c LP-Solver Clp 1.8.2
0.00/0.06 c user parameter file <scip.set> not found - using default parameters
0.00/0.06 c read problem <HOME/instance-1868647-1245130695.opb>
0.00/0.06 c original problem has 1328 variables (1328 bin, 0 int, 0 impl, 0 cont) and 3349 constraints
0.00/0.07 c No objective function, only one solution is needed.
0.00/0.07 c start presolving problem
0.00/0.07 c presolving:
0.09/0.13 c (round 1) 263 del vars, 282 del conss, 126 chg bounds, 92 chg sides, 256 chg coeffs, 0 upgd conss, 60990 impls, 0 clqs
0.09/0.14 c (round 2) 272 del vars, 663 del conss, 135 chg bounds, 92 chg sides, 256 chg coeffs, 0 upgd conss, 61032 impls, 0 clqs
0.09/0.19 c (round 3) 272 del vars, 675 del conss, 135 chg bounds, 92 chg sides, 256 chg coeffs, 2672 upgd conss, 61032 impls, 0 clqs
0.19/0.20 c (round 4) 272 del vars, 675 del conss, 135 chg bounds, 92 chg sides, 256 chg coeffs, 2674 upgd conss, 61032 impls, 0 clqs
0.19/0.22 c presolving (5 rounds):
0.19/0.22 c 272 deleted vars, 675 deleted constraints, 135 tightened bounds, 0 added holes, 92 changed sides, 256 changed coefficients
0.19/0.22 c 61032 implications, 0 cliques
0.19/0.22 c presolved problem has 1056 variables (1056 bin, 0 int, 0 impl, 0 cont) and 2674 constraints
0.19/0.22 c 176 constraints of type <knapsack>
0.19/0.22 c 2498 constraints of type <logicor>
0.19/0.22 c transformed objective value is always integral (scale: 1)
0.19/0.22 c Presolving Time: 0.13
0.19/0.22 c SATUNSAT-LIN
0.19/0.22 c -----------------------------------------------------------------------------------------------
0.19/0.22 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.22 c separating/flowcover/freq = c -1
0.19/0.22 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.22 c separating/cmir/freq = c -1
0.19/0.22 c # additional number of allowed LP iterations
0.19/0.22 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.22 c heuristics/veclendiving/maxlpiterofs = c 1500
0.19/0.22 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.22 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.19/0.22 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.22 c heuristics/veclendiving/freq = c -1
0.19/0.22 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.22 c heuristics/simplerounding/freq = c -1
0.19/0.22 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.22 c heuristics/shifting/freq = c -1
0.19/0.22 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.22 c heuristics/rounding/freq = c -1
0.19/0.22 c # additional number of allowed LP iterations
0.19/0.22 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.22 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.19/0.22 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.19/0.22 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.19/0.22 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.22 c heuristics/rootsoldiving/freq = c -1
0.19/0.22 c # number of nodes added to the contingent of the total nodes
0.19/0.22 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.19/0.22 c heuristics/rens/nodesofs = c 2000
0.19/0.22 c # minimum percentage of integer variables that have to be fixable
0.19/0.22 c # [type: real, range: [0,1], default: 0.5]
0.19/0.22 c heuristics/rens/minfixingrate = c 0.3
0.19/0.22 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.22 c heuristics/rens/freq = c -1
0.19/0.22 c # additional number of allowed LP iterations
0.19/0.22 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.22 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.19/0.22 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.22 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.19/0.22 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.22 c heuristics/pscostdiving/freq = c -1
0.19/0.22 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.22 c heuristics/oneopt/freq = c -1
0.19/0.22 c # additional number of allowed LP iterations
0.19/0.22 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.22 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.19/0.22 c # maximal fraction of diving LP iterations compared to total iteration number
0.19/0.22 c # [type: real, range: [0,1], default: 0.01]
0.19/0.22 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.19/0.22 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.22 c heuristics/objpscostdiving/freq = c -1
0.19/0.22 c # additional number of allowed LP iterations
0.19/0.22 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.22 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.19/0.22 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.22 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.19/0.22 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.22 c heuristics/linesearchdiving/freq = c -1
0.19/0.22 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.22 c heuristics/intshifting/freq = c -1
0.19/0.22 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.22 c heuristics/intdiving/maxlpiterquot = c 0.075
0.19/0.22 c # additional number of allowed LP iterations
0.19/0.22 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.22 c heuristics/guideddiving/maxlpiterofs = c 1500
0.19/0.22 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.22 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.19/0.22 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.22 c heuristics/guideddiving/freq = c -1
0.19/0.22 c # additional number of allowed LP iterations
0.19/0.22 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.22 c heuristics/fracdiving/maxlpiterofs = c 1500
0.19/0.22 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.22 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.19/0.22 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.22 c heuristics/fracdiving/freq = c -1
0.19/0.22 c # additional number of allowed LP iterations
0.19/0.22 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.22 c heuristics/feaspump/maxlpiterofs = c 2000
0.19/0.22 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.22 c heuristics/feaspump/freq = c -1
0.19/0.22 c # minimum percentage of integer variables that have to be fixed
0.19/0.22 c # [type: real, range: [0,1], default: 0.666]
0.19/0.22 c heuristics/crossover/minfixingrate = c 0.5
0.19/0.22 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.19/0.22 c # [type: real, range: [0,1], default: 0.1]
0.19/0.22 c heuristics/crossover/nodesquot = c 0.15
0.19/0.22 c # number of nodes without incumbent change that heuristic should wait
0.19/0.22 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.19/0.22 c heuristics/crossover/nwaitingnodes = c 100
0.19/0.22 c # number of nodes added to the contingent of the total nodes
0.19/0.22 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.19/0.22 c heuristics/crossover/nodesofs = c 750
0.19/0.22 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 30]
0.19/0.22 c heuristics/crossover/freq = c -1
0.19/0.22 c # additional number of allowed LP iterations
0.19/0.22 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.22 c heuristics/coefdiving/maxlpiterofs = c 1500
0.19/0.22 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.22 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.19/0.22 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.22 c heuristics/coefdiving/freq = c -1
0.19/0.22 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.22 c presolving/probing/maxrounds = c 0
0.19/0.22 c # should presolving try to simplify knapsacks
0.19/0.22 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.22 c constraints/knapsack/simplifyinequalities = c TRUE
0.19/0.22 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.19/0.22 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.19/0.22 c constraints/knapsack/disaggregation = c FALSE
0.19/0.22 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.22 c constraints/knapsack/maxnumcardlift = c 0
0.19/0.22 c # should presolving try to simplify inequalities
0.19/0.22 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.22 c constraints/linear/simplifyinequalities = c TRUE
0.19/0.22 c # maximal number of separation rounds in the root node (-1: unlimited)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.22 c separating/maxroundsroot = c 5
0.19/0.22 c # maximal number of separation rounds per node (-1: unlimited)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 5]
0.19/0.22 c separating/maxrounds = c 1
0.19/0.22 c # solving stops, if the given number of solutions were found (-1: no limit)
0.19/0.22 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.22 c limits/solutions = c 1
0.19/0.22 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.19/0.22 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.22 c limits/memory = c 1620
0.19/0.22 c # maximal time in seconds to run
0.19/0.22 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.22 c limits/time = c 1791
0.19/0.22 c # frequency for displaying node information lines
0.19/0.22 c # [type: int, range: [-1,2147483647], default: 100]
0.19/0.22 c display/freq = c 10000
0.19/0.22 c -----------------------------------------------------------------------------------------------
0.19/0.22 c start solving problem
0.19/0.22 c
0.19/0.27 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.27 c 0.2s| 1 | 0 | 381 |7670k| 0 | 275 |1056 |2674 |2674 |1056 |2674 | 0 | 0 | 0 | 1.636005e+02 | -- | Inf
0.40/0.43 c 0.3s| 1 | 0 | 612 |7802k| 0 | 316 |1056 |2674 |2674 |1056 |2738 | 64 | 0 | 0 | 2.076788e+02 | -- | Inf
0.49/0.59 c 0.5s| 1 | 0 | 829 |8045k| 0 | 338 |1056 |2674 |2674 |1056 |2808 | 134 | 0 | 0 | 2.135629e+02 | -- | Inf
0.69/0.76 c 0.7s| 1 | 0 | 1041 |8293k| 0 | 351 |1056 |2674 |2674 |1056 |2875 | 201 | 0 | 0 | 2.200393e+02 | -- | Inf
0.89/0.99 c 0.9s| 1 | 0 | 1346 |8518k| 0 | 370 |1056 |2674 |2674 |1056 |2937 | 263 | 0 | 0 | 2.237873e+02 | -- | Inf
1.29/1.33 c 1.2s| 1 | 0 | 1716 |8950k| 0 | 326 |1056 |2674 |2674 |1056 |2974 | 300 | 0 | 0 | 2.269200e+02 | -- | Inf
1.69/1.70 c 1.6s| 1 | 2 | 1716 |8951k| 0 | 326 |1056 |2674 |2674 |1056 |2974 | 300 | 0 | 18 | 2.269200e+02 | -- | Inf
21.48/21.60 c
21.48/21.60 c SCIP Status : problem is solved [infeasible]
21.48/21.60 c Solving Time (sec) : 21.28
21.48/21.60 c Solving Nodes : 21
21.48/21.60 c Primal Bound : +1.00000000000000e+20 (0 solutions)
21.48/21.60 c Dual Bound : +1.00000000000000e+20
21.48/21.60 c Gap : 0.00 %
21.48/21.60 c NODE 21
21.48/21.60 c DUAL BOUND 1e+20
21.48/21.60 c PRIMAL BOUND 1e+20
21.48/21.60 c GAP 0
21.48/21.60 s UNSATISFIABLE
21.48/21.60 c SCIP Status : problem is solved [infeasible]
21.48/21.60 c Solving Time : 21.28
21.48/21.60 c Original Problem :
21.48/21.60 c Problem name : HOME/instance-1868647-1245130695.opb
21.48/21.60 c Variables : 1328 (1328 binary, 0 integer, 0 implicit integer, 0 continuous)
21.48/21.60 c Constraints : 3349 initial, 3349 maximal
21.48/21.60 c Presolved Problem :
21.48/21.60 c Problem name : t_HOME/instance-1868647-1245130695.opb
21.48/21.60 c Variables : 1056 (1056 binary, 0 integer, 0 implicit integer, 0 continuous)
21.48/21.60 c Constraints : 2674 initial, 2680 maximal
21.48/21.60 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
21.48/21.60 c trivial : 0.00 0 0 0 0 0 0 0 0
21.48/21.60 c dualfix : 0.00 0 0 0 0 0 0 0 0
21.48/21.60 c boundshift : 0.00 0 0 0 0 0 0 0 0
21.48/21.60 c inttobinary : 0.00 0 0 0 0 0 0 0 0
21.48/21.60 c implics : 0.01 0 135 0 0 0 0 0 0
21.48/21.60 c probing : 0.00 0 0 0 0 0 0 0 0
21.48/21.60 c knapsack : 0.01 0 0 0 0 0 0 0 0
21.48/21.60 c linear : 0.08 135 2 0 135 0 675 92 256
21.48/21.60 c logicor : 0.03 0 0 0 0 0 0 0 0
21.48/21.60 c root node : - 8 - - 8 - - - -
21.48/21.60 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
21.48/21.60 c integral : 0 0 0 40 0 7 94 0 0 20
21.48/21.60 c knapsack : 176 5 445 0 0 0 0 286 0 0
21.48/21.60 c logicor : 2498+ 5 441 0 0 4 3244 0 0 0
21.48/21.60 c countsols : 0 0 0 0 0 0 0 0 0 0
21.48/21.60 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
21.48/21.60 c integral : 18.81 0.00 0.00 18.81 0.00
21.48/21.60 c knapsack : 0.01 0.01 0.00 0.00 0.00
21.48/21.60 c logicor : 0.03 0.00 0.03 0.00 0.00
21.48/21.60 c countsols : 0.00 0.00 0.00 0.00 0.00
21.48/21.60 c Propagators : Time Calls Cutoffs DomReds
21.48/21.60 c rootredcost : 0.00 0 0 0
21.48/21.60 c pseudoobj : 0.03 457 0 0
21.48/21.60 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
21.48/21.60 c propagation : 0.00 4 4 8 10.8 0 0.0 -
21.48/21.60 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
21.48/21.60 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
21.48/21.60 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
21.48/21.60 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
21.48/21.60 c applied globally : - - - 6 10.3 - - -
21.48/21.60 c applied locally : - - - 0 0.0 - - -
21.48/21.60 c Separators : Time Calls Cutoffs DomReds Cuts Conss
21.48/21.60 c cut pool : 0.00 4 - - 143 - (maximal pool size: 1345)
21.48/21.60 c redcost : 0.00 24 0 0 0 0
21.48/21.60 c impliedbounds : 0.00 5 0 0 0 0
21.48/21.60 c intobj : 0.00 0 0 0 0 0
21.48/21.60 c gomory : 0.35 5 0 0 2500 0
21.48/21.60 c strongcg : 0.25 5 0 0 2500 0
21.48/21.60 c cmir : 0.00 0 0 0 0 0
21.48/21.60 c flowcover : 0.00 0 0 0 0 0
21.48/21.60 c clique : 0.06 5 0 0 42 0
21.48/21.60 c zerohalf : 0.00 0 0 0 0 0
21.48/21.60 c mcf : 0.01 1 0 0 0 0
21.48/21.60 c Pricers : Time Calls Vars
21.48/21.60 c problem variables: 0.00 0 0
21.48/21.60 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
21.48/21.60 c relpscost : 18.81 40 7 94 0 0 20
21.48/21.60 c pscost : 0.00 0 0 0 0 0 0
21.48/21.60 c inference : 0.00 0 0 0 0 0 0
21.48/21.60 c mostinf : 0.00 0 0 0 0 0 0
21.48/21.60 c leastinf : 0.00 0 0 0 0 0 0
21.48/21.60 c fullstrong : 0.00 0 0 0 0 0 0
21.48/21.60 c allfullstrong : 0.00 0 0 0 0 0 0
21.48/21.60 c random : 0.00 0 0 0 0 0 0
21.48/21.60 c Primal Heuristics : Time Calls Found
21.48/21.60 c LP solutions : 0.00 - 0
21.48/21.60 c pseudo solutions : 0.00 - 0
21.48/21.60 c simplerounding : 0.00 0 0
21.48/21.60 c rounding : 0.00 0 0
21.48/21.60 c shifting : 0.00 0 0
21.48/21.60 c intshifting : 0.00 0 0
21.48/21.60 c oneopt : 0.00 0 0
21.48/21.60 c fixandinfer : 0.00 0 0
21.48/21.60 c feaspump : 0.00 0 0
21.48/21.60 c coefdiving : 0.00 0 0
21.48/21.60 c pscostdiving : 0.00 0 0
21.48/21.60 c fracdiving : 0.00 0 0
21.48/21.60 c veclendiving : 0.00 0 0
21.48/21.60 c intdiving : 0.00 0 0
21.48/21.60 c actconsdiving : 0.00 0 0
21.48/21.60 c objpscostdiving : 0.00 0 0
21.48/21.60 c rootsoldiving : 0.00 0 0
21.48/21.60 c linesearchdiving : 0.00 0 0
21.48/21.60 c guideddiving : 0.00 0 0
21.48/21.60 c octane : 0.00 0 0
21.48/21.60 c rens : 0.00 0 0
21.48/21.60 c rins : 0.00 0 0
21.48/21.60 c localbranching : 0.00 0 0
21.48/21.60 c mutation : 0.00 0 0
21.48/21.60 c crossover : 0.00 0 0
21.48/21.60 c dins : 0.00 0 0
21.48/21.60 c LP : Time Calls Iterations Iter/call Iter/sec
21.59/21.60 c primal LP : 0.02 0 0 0.00 0.00
21.59/21.60 c dual LP : 1.49 45 6466 143.69 4339.60
21.59/21.60 c barrier LP : 0.00 0 0 0.00 -
21.59/21.60 c diving/probing LP: 0.00 0 0 0.00 -
21.59/21.60 c strong branching : 18.79 628 75322 119.94 4008.62
21.59/21.60 c (at root node) : - 18 1029 57.17 -
21.59/21.60 c conflict analysis: 0.00 0 0 0.00 -
21.59/21.60 c B&B Tree :
21.59/21.60 c number of runs : 1
21.59/21.60 c nodes : 21
21.59/21.60 c nodes (total) : 21
21.59/21.60 c nodes left : 0
21.59/21.60 c max depth : 5
21.59/21.60 c max depth (total): 5
21.59/21.60 c backtracks : 6 (28.6%)
21.59/21.60 c delayed cutoffs : 0
21.59/21.60 c repropagations : 1 (1 domain reductions, 0 cutoffs)
21.59/21.60 c avg switch length: 2.57
21.59/21.60 c switching time : 0.05
21.59/21.60 c Solution :
21.59/21.60 c Solutions found : 0 (0 improvements)
21.59/21.60 c Primal Bound : infeasible
21.59/21.60 c Dual Bound : -
21.59/21.60 c Gap : 0.00 %
21.59/21.60 c Root Dual Bound : +2.26920000000000e+02
21.59/21.62 c Time complete: 21.61.