0.00/0.02 c SCIP version 1.1.0.7
0.00/0.02 c LP-Solver Clp 1.8.2
0.00/0.02 c user parameter file <scip.set> not found - using default parameters
0.00/0.02 c read problem <HOME/instance-1870601-1245213364.opb>
0.00/0.02 c original problem has 1580 variables (1580 bin, 0 int, 0 impl, 0 cont) and 1632 constraints
0.00/0.03 c No objective function, only one solution is needed.
0.00/0.03 c start presolving problem
0.00/0.03 c presolving:
0.09/0.18 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 11940 impls, 100 clqs
0.29/0.31 c presolving (2 rounds):
0.29/0.31 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.31 c 11940 implications, 100 cliques
0.29/0.31 c presolved problem has 1580 variables (1580 bin, 0 int, 0 impl, 0 cont) and 1632 constraints
0.29/0.31 c 1 constraints of type <knapsack>
0.29/0.31 c 100 constraints of type <setppc>
0.29/0.31 c 1480 constraints of type <and>
0.29/0.31 c 1 constraints of type <linear>
0.29/0.31 c 50 constraints of type <logicor>
0.29/0.31 c transformed objective value is always integral (scale: 1)
0.29/0.31 c Presolving Time: 0.12
0.29/0.31 c SATUNSAT-NLC
0.29/0.31 c -----------------------------------------------------------------------------------------------
0.29/0.31 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.31 c separating/flowcover/freq = c -1
0.29/0.31 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.31 c separating/cmir/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/veclendiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.29/0.31 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/veclendiving/freq = c -1
0.29/0.31 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.31 c heuristics/simplerounding/freq = c -1
0.29/0.31 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/shifting/freq = c -1
0.29/0.31 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.31 c heuristics/rounding/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.31 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.29/0.31 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.31 c heuristics/rootsoldiving/freq = c -1
0.29/0.31 c # number of nodes added to the contingent of the total nodes
0.29/0.31 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.31 c heuristics/rens/nodesofs = c 2000
0.29/0.31 c # minimum percentage of integer variables that have to be fixable
0.29/0.31 c # [type: real, range: [0,1], default: 0.5]
0.29/0.31 c heuristics/rens/minfixingrate = c 0.3
0.29/0.31 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.31 c heuristics/rens/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.29/0.31 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/pscostdiving/freq = c -1
0.29/0.31 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.31 c heuristics/oneopt/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.31 c # [type: real, range: [0,1], default: 0.01]
0.29/0.31 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.29/0.31 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.31 c heuristics/objpscostdiving/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.29/0.31 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/linesearchdiving/freq = c -1
0.29/0.31 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/intshifting/freq = c -1
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/intdiving/maxlpiterquot = c 0.075
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/guideddiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.29/0.31 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/guideddiving/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/fracdiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.29/0.31 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/fracdiving/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/feaspump/maxlpiterofs = c 2000
0.29/0.31 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.31 c heuristics/feaspump/freq = c -1
0.29/0.31 c # minimum percentage of integer variables that have to be fixed
0.29/0.31 c # [type: real, range: [0,1], default: 0.666]
0.29/0.31 c heuristics/crossover/minfixingrate = c 0.5
0.29/0.31 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.31 c # [type: real, range: [0,1], default: 0.1]
0.29/0.31 c heuristics/crossover/nodesquot = c 0.15
0.29/0.31 c # number of nodes without incumbent change that heuristic should wait
0.29/0.31 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.31 c heuristics/crossover/nwaitingnodes = c 100
0.29/0.31 c # number of nodes added to the contingent of the total nodes
0.29/0.31 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.31 c heuristics/crossover/nodesofs = c 750
0.29/0.31 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.31 c heuristics/crossover/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/coefdiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.29/0.31 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/coefdiving/freq = c -1
0.29/0.31 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.31 c presolving/probing/maxrounds = c 0
0.29/0.31 c # should presolving try to simplify knapsacks
0.29/0.31 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.31 c constraints/knapsack/simplifyinequalities = c TRUE
0.29/0.31 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.31 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.31 c constraints/knapsack/disaggregation = c FALSE
0.29/0.31 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.31 c constraints/knapsack/maxnumcardlift = c 0
0.29/0.31 c # should presolving try to simplify inequalities
0.29/0.31 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.31 c constraints/linear/simplifyinequalities = c TRUE
0.29/0.31 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.31 c separating/maxroundsroot = c 5
0.29/0.31 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.31 c separating/maxrounds = c 1
0.29/0.31 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.31 c limits/solutions = c 1
0.29/0.31 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.31 c limits/memory = c 1620
0.29/0.31 c # maximal time in seconds to run
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.31 c limits/time = c 1791
0.29/0.31 c # frequency for displaying node information lines
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.31 c display/freq = c 10000
0.29/0.31 c -----------------------------------------------------------------------------------------------
0.29/0.31 c start solving problem
0.29/0.31 c
0.29/0.35 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.35 c 0.2s| 1 | 0 | 67 |7117k| 0 | 60 |1580 |1632 |1632 |1580 |3112 | 0 | 0 | 0 | 3.000000e+01 | -- | Inf
0.49/0.56 c 0.4s| 1 | 0 | 102 |7138k| 0 | 61 |1580 |1632 |1632 |1580 |3113 | 1 | 0 | 0 | 3.000000e+01 | -- | Inf
0.79/0.81 c 0.6s| 1 | 0 | 179 |7191k| 0 | 64 |1580 |1632 |1632 |1580 |3114 | 2 | 0 | 0 | 3.000000e+01 | -- | Inf
1.38/1.41 c 1.2s| 1 | 0 | 202 |7219k| 0 | 64 |1580 |1632 |1632 |1580 |3116 | 4 | 0 | 0 | 3.000000e+01 | -- | Inf
1.89/1.98 c 1.8s| 1 | 0 | 309 |7233k| 0 | 63 |1580 |1632 |1632 |1580 |3117 | 5 | 0 | 0 | 3.000000e+01 | -- | Inf
2.39/2.48 c 2.3s| 1 | 0 | 326 |7254k| 0 | 63 |1580 |1632 |1632 |1580 |3118 | 6 | 0 | 0 | 3.000000e+01 | -- | Inf
5.59/5.67 c 5.4s| 1 | 2 | 326 |7254k| 0 | 63 |1580 |1632 |1632 |1580 |3118 | 6 | 0 | 33 | 3.000000e+01 | -- | Inf
22.99/23.07 c
22.99/23.07 c SCIP Status : problem is solved [infeasible]
22.99/23.07 c Solving Time (sec) : 22.73
22.99/23.07 c Solving Nodes : 253
22.99/23.07 c Primal Bound : +1.00000000000000e+20 (0 solutions)
22.99/23.07 c Dual Bound : +1.00000000000000e+20
22.99/23.07 c Gap : 0.00 %
22.99/23.07 c NODE 253
22.99/23.07 c DUAL BOUND 1e+20
22.99/23.07 c PRIMAL BOUND 1e+20
22.99/23.07 c GAP 0
22.99/23.07 s UNSATISFIABLE
22.99/23.07 c SCIP Status : problem is solved [infeasible]
22.99/23.07 c Solving Time : 22.73
22.99/23.07 c Original Problem :
22.99/23.07 c Problem name : HOME/instance-1870601-1245213364.opb
22.99/23.07 c Variables : 1580 (1580 binary, 0 integer, 0 implicit integer, 0 continuous)
22.99/23.07 c Constraints : 1632 initial, 1632 maximal
22.99/23.07 c Presolved Problem :
22.99/23.07 c Problem name : t_HOME/instance-1870601-1245213364.opb
22.99/23.07 c Variables : 1580 (1580 binary, 0 integer, 0 implicit integer, 0 continuous)
22.99/23.07 c Constraints : 1632 initial, 1632 maximal
22.99/23.07 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
22.99/23.07 c trivial : 0.00 0 0 0 0 0 0 0 0
22.99/23.07 c dualfix : 0.00 0 0 0 0 0 0 0 0
22.99/23.07 c boundshift : 0.00 0 0 0 0 0 0 0 0
22.99/23.07 c inttobinary : 0.00 0 0 0 0 0 0 0 0
22.99/23.07 c implics : 0.00 0 0 0 0 0 0 0 0
22.99/23.07 c probing : 0.00 0 0 0 0 0 0 0 0
22.99/23.07 c knapsack : 0.00 0 0 0 0 0 0 0 0
22.99/23.07 c setppc : 0.00 0 0 0 0 0 0 0 0
22.99/23.07 c and : 0.11 0 0 0 0 0 0 0 0
22.99/23.07 c linear : 0.01 0 0 0 0 0 0 0 0
22.99/23.07 c logicor : 0.00 0 0 0 0 0 0 0 0
22.99/23.07 c root node : - 114 - - 114 - - - -
22.99/23.07 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
22.99/23.07 c integral : 0 0 0 186 0 6 75 0 0 252
22.99/23.07 c knapsack : 1 5 677 26 0 6 28 0 0 0
22.99/23.07 c setppc : 100 5 671 26 0 0 606 0 0 0
22.99/23.07 c and : 1480 241 671 26 0 1 14605 26978 0 0
22.99/23.07 c linear : 1 5 670 0 0 1 0 0 0 0
22.99/23.07 c logicor : 50+ 5 210 0 0 0 116 0 0 0
22.99/23.07 c countsols : 0 0 0 0 0 0 0 0 0 0
22.99/23.07 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
22.99/23.07 c integral : 14.01 0.00 0.00 14.01 0.00
22.99/23.07 c knapsack : 0.00 0.00 0.00 0.00 0.00
22.99/23.07 c setppc : 0.00 0.00 0.00 0.00 0.00
22.99/23.07 c and : 0.28 0.20 0.08 0.00 0.00
22.99/23.07 c linear : 0.01 0.00 0.01 0.00 0.00
22.99/23.07 c logicor : 0.00 0.00 0.00 0.00 0.00
22.99/23.07 c countsols : 0.00 0.00 0.00 0.00 0.00
22.99/23.07 c Propagators : Time Calls Cutoffs DomReds
22.99/23.07 c rootredcost : 0.00 0 0 0
22.99/23.07 c pseudoobj : 0.14 681 1 0
22.99/23.07 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
22.99/23.07 c propagation : 0.00 8 8 9 22.9 0 0.0 -
22.99/23.07 c infeasible LP : 0.05 112 0 0 0.0 0 0.0 0
22.99/23.07 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
22.99/23.07 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
22.99/23.07 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
22.99/23.07 c applied globally : - - - 8 20.9 - - -
22.99/23.07 c applied locally : - - - 0 0.0 - - -
22.99/23.07 c Separators : Time Calls Cutoffs DomReds Cuts Conss
22.99/23.07 c cut pool : 0.00 4 - - 0 - (maximal pool size: 21)
22.99/23.07 c redcost : 0.06 241 0 0 0 0
22.99/23.07 c impliedbounds : 0.00 5 0 0 0 0
22.99/23.07 c intobj : 0.00 0 0 0 0 0
22.99/23.07 c gomory : 1.28 5 0 0 1000 0
22.99/23.07 c strongcg : 0.64 5 0 0 2500 0
22.99/23.07 c cmir : 0.00 0 0 0 0 0
22.99/23.07 c flowcover : 0.00 0 0 0 0 0
22.99/23.07 c clique : 0.01 5 0 0 0 0
22.99/23.07 c zerohalf : 0.00 0 0 0 0 0
22.99/23.07 c mcf : 0.02 2 0 0 0 0
22.99/23.07 c Pricers : Time Calls Vars
22.99/23.07 c problem variables: 0.00 0 0
22.99/23.07 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
22.99/23.07 c relpscost : 14.01 160 6 75 0 0 252
22.99/23.07 c pscost : 0.00 0 0 0 0 0 0
22.99/23.07 c inference : 0.00 0 0 0 0 0 0
22.99/23.07 c mostinf : 0.00 0 0 0 0 0 0
22.99/23.07 c leastinf : 0.00 0 0 0 0 0 0
22.99/23.07 c fullstrong : 0.00 0 0 0 0 0 0
22.99/23.07 c allfullstrong : 0.00 0 0 0 0 0 0
22.99/23.07 c random : 0.00 0 0 0 0 0 0
22.99/23.07 c Primal Heuristics : Time Calls Found
22.99/23.07 c LP solutions : 0.00 - 0
22.99/23.07 c pseudo solutions : 0.00 - 0
22.99/23.07 c simplerounding : 0.00 0 0
22.99/23.07 c rounding : 0.00 0 0
22.99/23.07 c shifting : 0.00 0 0
22.99/23.07 c intshifting : 0.00 0 0
22.99/23.07 c oneopt : 0.00 0 0
22.99/23.07 c fixandinfer : 0.00 0 0
22.99/23.07 c feaspump : 0.00 0 0
22.99/23.07 c coefdiving : 0.00 0 0
22.99/23.07 c pscostdiving : 0.00 0 0
22.99/23.07 c fracdiving : 0.00 0 0
22.99/23.07 c veclendiving : 0.00 0 0
22.99/23.07 c intdiving : 0.00 0 0
22.99/23.07 c actconsdiving : 0.00 0 0
22.99/23.07 c objpscostdiving : 0.00 0 0
22.99/23.07 c rootsoldiving : 0.00 0 0
22.99/23.07 c linesearchdiving : 0.00 0 0
22.99/23.07 c guideddiving : 0.00 0 0
22.99/23.07 c octane : 0.00 0 0
22.99/23.07 c rens : 0.00 0 0
22.99/23.07 c rins : 0.00 0 0
22.99/23.07 c localbranching : 0.00 0 0
22.99/23.07 c mutation : 0.00 0 0
22.99/23.07 c crossover : 0.00 0 0
22.99/23.07 c dins : 0.00 0 0
22.99/23.07 c LP : Time Calls Iterations Iter/call Iter/sec
22.99/23.07 c primal LP : 0.50 0 0 0.00 0.00
22.99/23.07 c dual LP : 5.10 525 31977 60.91 6270.00
22.99/23.07 c barrier LP : 0.00 0 0 0.00 -
22.99/23.07 c diving/probing LP: 0.00 0 0 0.00 -
22.99/23.07 c strong branching : 13.98 1426 80784 56.65 5778.54
22.99/23.07 c (at root node) : - 33 5805 175.91 -
22.99/23.07 c conflict analysis: 0.00 0 0 0.00 -
22.99/23.07 c B&B Tree :
22.99/23.07 c number of runs : 1
22.99/23.07 c nodes : 253
22.99/23.07 c nodes (total) : 253
22.99/23.07 c nodes left : 0
22.99/23.07 c max depth : 48
22.99/23.07 c max depth (total): 48
22.99/23.07 c backtracks : 54 (21.3%)
22.99/23.07 c delayed cutoffs : 0
22.99/23.07 c repropagations : 23 (6 domain reductions, 0 cutoffs)
22.99/23.07 c avg switch length: 2.91
22.99/23.07 c switching time : 0.59
22.99/23.07 c Solution :
22.99/23.07 c Solutions found : 0 (0 improvements)
22.99/23.07 c Primal Bound : infeasible
22.99/23.07 c Dual Bound : -
22.99/23.07 c Gap : 0.00 %
22.99/23.07 c Root Dual Bound : +3.00000000000000e+01
22.99/23.09 c Time complete: 23.08.