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-1870687-1245215742.opb>
0.00/0.02 c original problem has 1564 variables (1564 bin, 0 int, 0 impl, 0 cont) and 1616 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.17 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 11812 impls, 100 clqs
0.20/0.29 c presolving (2 rounds):
0.20/0.29 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.20/0.29 c 11812 implications, 100 cliques
0.20/0.29 c presolved problem has 1564 variables (1564 bin, 0 int, 0 impl, 0 cont) and 1616 constraints
0.20/0.29 c 1 constraints of type <knapsack>
0.20/0.29 c 100 constraints of type <setppc>
0.20/0.29 c 1464 constraints of type <and>
0.20/0.29 c 1 constraints of type <linear>
0.20/0.29 c 50 constraints of type <logicor>
0.20/0.29 c transformed objective value is always integral (scale: 1)
0.20/0.29 c Presolving Time: 0.12
0.20/0.29 c SATUNSAT-NLC
0.20/0.29 c -----------------------------------------------------------------------------------------------
0.20/0.29 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.20/0.29 c # [type: int, range: [-1,2147483647], default: 0]
0.20/0.29 c separating/flowcover/freq = c -1
0.20/0.29 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.20/0.29 c # [type: int, range: [-1,2147483647], default: 0]
0.20/0.29 c separating/cmir/freq = c -1
0.20/0.29 c # additional number of allowed LP iterations
0.20/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.29 c heuristics/veclendiving/maxlpiterofs = c 1500
0.20/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.20/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.20/0.29 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.20/0.29 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.20/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.20/0.29 c heuristics/veclendiving/freq = c -1
0.20/0.29 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.20/0.29 c # [type: int, range: [-1,2147483647], default: 1]
0.20/0.29 c heuristics/simplerounding/freq = c -1
0.20/0.29 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.20/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.20/0.29 c heuristics/shifting/freq = c -1
0.20/0.29 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.20/0.29 c # [type: int, range: [-1,2147483647], default: 1]
0.20/0.29 c heuristics/rounding/freq = c -1
0.20/0.29 c # additional number of allowed LP iterations
0.20/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.29 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.20/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.20/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.20/0.29 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.20/0.29 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.20/0.29 c # [type: int, range: [-1,2147483647], default: 20]
0.20/0.29 c heuristics/rootsoldiving/freq = c -1
0.20/0.29 c # number of nodes added to the contingent of the total nodes
0.20/0.29 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.20/0.29 c heuristics/rens/nodesofs = c 2000
0.20/0.29 c # minimum percentage of integer variables that have to be fixable
0.20/0.29 c # [type: real, range: [0,1], default: 0.5]
0.20/0.29 c heuristics/rens/minfixingrate = c 0.3
0.20/0.29 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.20/0.29 c # [type: int, range: [-1,2147483647], default: 0]
0.20/0.29 c heuristics/rens/freq = c -1
0.20/0.29 c # additional number of allowed LP iterations
0.20/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.29 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.20/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.20/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.20/0.29 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.20/0.29 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.20/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.20/0.29 c heuristics/pscostdiving/freq = c -1
0.20/0.29 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.20/0.29 c # [type: int, range: [-1,2147483647], default: 1]
0.20/0.29 c heuristics/oneopt/freq = c -1
0.20/0.29 c # additional number of allowed LP iterations
0.20/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.29 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.20/0.29 c # maximal fraction of diving LP iterations compared to total iteration number
0.20/0.29 c # [type: real, range: [0,1], default: 0.01]
0.20/0.29 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.20/0.29 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.20/0.29 c # [type: int, range: [-1,2147483647], default: 20]
0.20/0.29 c heuristics/objpscostdiving/freq = c -1
0.20/0.29 c # additional number of allowed LP iterations
0.20/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.29 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.20/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.20/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.20/0.29 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.20/0.29 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.20/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.20/0.29 c heuristics/linesearchdiving/freq = c -1
0.20/0.29 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.20/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.20/0.29 c heuristics/intshifting/freq = c -1
0.20/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.20/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.20/0.29 c heuristics/intdiving/maxlpiterquot = c 0.075
0.20/0.29 c # additional number of allowed LP iterations
0.20/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.29 c heuristics/guideddiving/maxlpiterofs = c 1500
0.20/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.20/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.20/0.29 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.20/0.29 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.20/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.20/0.29 c heuristics/guideddiving/freq = c -1
0.20/0.29 c # additional number of allowed LP iterations
0.20/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.29 c heuristics/fracdiving/maxlpiterofs = c 1500
0.20/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.20/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.20/0.29 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.20/0.29 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.20/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.20/0.29 c heuristics/fracdiving/freq = c -1
0.20/0.29 c # additional number of allowed LP iterations
0.20/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.29 c heuristics/feaspump/maxlpiterofs = c 2000
0.20/0.29 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.20/0.29 c # [type: int, range: [-1,2147483647], default: 20]
0.20/0.29 c heuristics/feaspump/freq = c -1
0.20/0.29 c # minimum percentage of integer variables that have to be fixed
0.20/0.29 c # [type: real, range: [0,1], default: 0.666]
0.20/0.29 c heuristics/crossover/minfixingrate = c 0.5
0.20/0.29 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.20/0.29 c # [type: real, range: [0,1], default: 0.1]
0.20/0.29 c heuristics/crossover/nodesquot = c 0.15
0.20/0.29 c # number of nodes without incumbent change that heuristic should wait
0.20/0.29 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.20/0.29 c heuristics/crossover/nwaitingnodes = c 100
0.20/0.29 c # number of nodes added to the contingent of the total nodes
0.20/0.29 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.20/0.29 c heuristics/crossover/nodesofs = c 750
0.20/0.29 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.20/0.29 c # [type: int, range: [-1,2147483647], default: 30]
0.20/0.29 c heuristics/crossover/freq = c -1
0.20/0.29 c # additional number of allowed LP iterations
0.20/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.20/0.29 c heuristics/coefdiving/maxlpiterofs = c 1500
0.20/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.20/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.20/0.29 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.20/0.29 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.20/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.20/0.29 c heuristics/coefdiving/freq = c -1
0.20/0.29 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.20/0.29 c # [type: int, range: [-1,2147483647], default: -1]
0.20/0.29 c presolving/probing/maxrounds = c 0
0.20/0.29 c # should presolving try to simplify knapsacks
0.20/0.29 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.20/0.29 c constraints/knapsack/simplifyinequalities = c TRUE
0.20/0.29 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.20/0.29 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.20/0.29 c constraints/knapsack/disaggregation = c FALSE
0.20/0.29 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.20/0.29 c # [type: int, range: [-1,2147483647], default: -1]
0.20/0.29 c constraints/knapsack/maxnumcardlift = c 0
0.20/0.29 c # should presolving try to simplify inequalities
0.20/0.30 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.20/0.30 c constraints/linear/simplifyinequalities = c TRUE
0.20/0.30 c # maximal number of separation rounds in the root node (-1: unlimited)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: -1]
0.20/0.30 c separating/maxroundsroot = c 5
0.20/0.30 c # maximal number of separation rounds per node (-1: unlimited)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 5]
0.20/0.30 c separating/maxrounds = c 1
0.20/0.30 c # solving stops, if the given number of solutions were found (-1: no limit)
0.20/0.30 c # [type: int, range: [-1,2147483647], default: -1]
0.20/0.30 c limits/solutions = c 1
0.20/0.30 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.20/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.20/0.30 c limits/memory = c 1620
0.20/0.30 c # maximal time in seconds to run
0.20/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.20/0.30 c limits/time = c 1791
0.20/0.30 c # frequency for displaying node information lines
0.20/0.30 c # [type: int, range: [-1,2147483647], default: 100]
0.20/0.30 c display/freq = c 10000
0.20/0.30 c -----------------------------------------------------------------------------------------------
0.20/0.30 c start solving problem
0.20/0.30 c
0.29/0.33 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.33 c 0.2s| 1 | 0 | 67 |7044k| 0 | 60 |1564 |1616 |1616 |1564 |3080 | 0 | 0 | 0 | 3.000000e+01 | -- | Inf
0.49/0.53 c 0.3s| 1 | 0 | 103 |7066k| 0 | 62 |1564 |1616 |1616 |1564 |3082 | 2 | 0 | 0 | 3.000000e+01 | -- | Inf
0.69/0.76 c 0.6s| 1 | 0 | 153 |7131k| 0 | 61 |1564 |1616 |1616 |1564 |3084 | 4 | 0 | 0 | 3.000000e+01 | -- | Inf
1.19/1.23 c 1.0s| 1 | 0 | 165 |7162k| 0 | 62 |1564 |1616 |1616 |1564 |3086 | 6 | 0 | 0 | 3.000000e+01 | -- | Inf
1.39/1.49 c 1.3s| 1 | 0 | 227 |7227k| 0 | 63 |1564 |1616 |1616 |1564 |3087 | 7 | 0 | 0 | 3.000000e+01 | -- | Inf
1.99/2.04 c 1.8s| 1 | 0 | 260 |7251k| 0 | 63 |1564 |1616 |1616 |1564 |3088 | 8 | 0 | 0 | 3.000000e+01 | -- | Inf
4.68/4.80 c 4.6s| 1 | 2 | 260 |7252k| 0 | 63 |1564 |1616 |1616 |1564 |3088 | 8 | 0 | 33 | 3.000000e+01 | -- | Inf
23.48/23.57 c
23.48/23.57 c SCIP Status : problem is solved [infeasible]
23.48/23.57 c Solving Time (sec) : 23.23
23.48/23.57 c Solving Nodes : 307
23.48/23.57 c Primal Bound : +1.00000000000000e+20 (0 solutions)
23.48/23.57 c Dual Bound : +1.00000000000000e+20
23.48/23.57 c Gap : 0.00 %
23.48/23.57 c NODE 307
23.48/23.57 c DUAL BOUND 1e+20
23.48/23.57 c PRIMAL BOUND 1e+20
23.48/23.57 c GAP 0
23.48/23.57 s UNSATISFIABLE
23.48/23.57 c SCIP Status : problem is solved [infeasible]
23.48/23.57 c Solving Time : 23.23
23.48/23.57 c Original Problem :
23.48/23.57 c Problem name : HOME/instance-1870687-1245215742.opb
23.48/23.57 c Variables : 1564 (1564 binary, 0 integer, 0 implicit integer, 0 continuous)
23.48/23.57 c Constraints : 1616 initial, 1616 maximal
23.48/23.57 c Presolved Problem :
23.48/23.57 c Problem name : t_HOME/instance-1870687-1245215742.opb
23.48/23.57 c Variables : 1564 (1564 binary, 0 integer, 0 implicit integer, 0 continuous)
23.48/23.57 c Constraints : 1616 initial, 1616 maximal
23.48/23.57 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
23.48/23.57 c trivial : 0.00 0 0 0 0 0 0 0 0
23.48/23.57 c dualfix : 0.00 0 0 0 0 0 0 0 0
23.48/23.57 c boundshift : 0.00 0 0 0 0 0 0 0 0
23.48/23.57 c inttobinary : 0.00 0 0 0 0 0 0 0 0
23.48/23.57 c implics : 0.00 0 0 0 0 0 0 0 0
23.48/23.57 c probing : 0.00 0 0 0 0 0 0 0 0
23.48/23.57 c knapsack : 0.00 0 0 0 0 0 0 0 0
23.48/23.57 c setppc : 0.00 0 0 0 0 0 0 0 0
23.48/23.57 c and : 0.10 0 0 0 0 0 0 0 0
23.48/23.57 c linear : 0.01 0 0 0 0 0 0 0 0
23.48/23.57 c logicor : 0.00 0 0 0 0 0 0 0 0
23.48/23.57 c root node : - 70 - - 70 - - - -
23.48/23.57 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
23.48/23.57 c integral : 0 0 0 213 0 3 97 0 0 306
23.48/23.57 c knapsack : 1 5 912 21 0 13 41 0 0 0
23.48/23.57 c setppc : 100 5 902 21 0 1 1260 0 0 0
23.48/23.57 c and : 1464 277 901 21 0 2 25799 34653 0 0
23.48/23.57 c linear : 1 5 899 0 0 2 0 0 0 0
23.48/23.57 c logicor : 50+ 5 262 0 0 0 171 0 0 0
23.48/23.57 c countsols : 0 0 0 0 0 0 0 0 0 0
23.48/23.57 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
23.48/23.57 c integral : 13.96 0.00 0.00 13.96 0.00
23.48/23.57 c knapsack : 0.01 0.00 0.01 0.00 0.00
23.48/23.57 c setppc : 0.00 0.00 0.00 0.00 0.00
23.48/23.57 c and : 0.49 0.35 0.13 0.01 0.00
23.48/23.57 c linear : 0.02 0.00 0.02 0.00 0.00
23.48/23.57 c logicor : 0.00 0.00 0.00 0.00 0.00
23.48/23.57 c countsols : 0.00 0.00 0.00 0.00 0.00
23.48/23.57 c Propagators : Time Calls Cutoffs DomReds
23.48/23.57 c rootredcost : 0.00 0 0 0
23.48/23.57 c pseudoobj : 0.08 921 0 0
23.48/23.57 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
23.48/23.57 c propagation : 0.00 18 18 21 17.9 0 0.0 -
23.48/23.57 c infeasible LP : 0.08 133 0 0 0.0 0 0.0 0
23.48/23.57 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
23.48/23.57 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
23.48/23.57 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
23.48/23.57 c applied globally : - - - 19 18.2 - - -
23.48/23.57 c applied locally : - - - 0 0.0 - - -
23.48/23.57 c Separators : Time Calls Cutoffs DomReds Cuts Conss
23.48/23.57 c cut pool : 0.00 4 - - 0 - (maximal pool size: 36)
23.48/23.57 c redcost : 0.03 277 0 0 0 0
23.48/23.57 c impliedbounds : 0.00 5 0 0 0 0
23.48/23.57 c intobj : 0.00 0 0 0 0 0
23.48/23.57 c gomory : 0.86 5 0 0 1500 0
23.48/23.57 c strongcg : 0.66 5 0 0 2500 0
23.48/23.57 c cmir : 0.00 0 0 0 0 0
23.48/23.57 c flowcover : 0.00 0 0 0 0 0
23.48/23.57 c clique : 0.01 5 0 0 0 0
23.48/23.57 c zerohalf : 0.00 0 0 0 0 0
23.48/23.57 c mcf : 0.02 2 0 0 0 0
23.48/23.57 c Pricers : Time Calls Vars
23.48/23.57 c problem variables: 0.00 0 0
23.48/23.57 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
23.48/23.57 c relpscost : 13.95 192 3 97 0 0 306
23.48/23.57 c pscost : 0.00 0 0 0 0 0 0
23.48/23.57 c inference : 0.00 0 0 0 0 0 0
23.48/23.57 c mostinf : 0.00 0 0 0 0 0 0
23.48/23.57 c leastinf : 0.00 0 0 0 0 0 0
23.48/23.57 c fullstrong : 0.00 0 0 0 0 0 0
23.48/23.57 c allfullstrong : 0.00 0 0 0 0 0 0
23.48/23.57 c random : 0.00 0 0 0 0 0 0
23.48/23.57 c Primal Heuristics : Time Calls Found
23.48/23.57 c LP solutions : 0.00 - 0
23.48/23.57 c pseudo solutions : 0.00 - 0
23.48/23.57 c simplerounding : 0.00 0 0
23.48/23.57 c rounding : 0.00 0 0
23.48/23.57 c shifting : 0.00 0 0
23.48/23.57 c intshifting : 0.00 0 0
23.48/23.57 c oneopt : 0.00 0 0
23.48/23.57 c fixandinfer : 0.00 0 0
23.48/23.57 c feaspump : 0.00 0 0
23.48/23.57 c coefdiving : 0.00 0 0
23.48/23.57 c pscostdiving : 0.00 0 0
23.48/23.57 c fracdiving : 0.00 0 0
23.48/23.57 c veclendiving : 0.00 0 0
23.48/23.57 c intdiving : 0.00 0 0
23.48/23.57 c actconsdiving : 0.00 0 0
23.48/23.57 c objpscostdiving : 0.00 0 0
23.48/23.57 c rootsoldiving : 0.00 0 0
23.48/23.57 c linesearchdiving : 0.00 0 0
23.48/23.57 c guideddiving : 0.00 0 0
23.48/23.57 c octane : 0.00 0 0
23.48/23.57 c rens : 0.00 0 0
23.48/23.57 c rins : 0.00 0 0
23.48/23.57 c localbranching : 0.00 0 0
23.48/23.57 c mutation : 0.00 0 0
23.48/23.57 c crossover : 0.00 0 0
23.48/23.57 c dins : 0.00 0 0
23.48/23.57 c LP : Time Calls Iterations Iter/call Iter/sec
23.48/23.57 c primal LP : 0.66 0 0 0.00 0.00
23.48/23.57 c dual LP : 5.55 603 37541 62.26 6764.14
23.48/23.57 c barrier LP : 0.00 0 0 0.00 -
23.48/23.57 c diving/probing LP: 0.00 0 0 0.00 -
23.48/23.57 c strong branching : 13.94 1630 93662 57.46 6718.94
23.48/23.57 c (at root node) : - 33 5402 163.70 -
23.48/23.57 c conflict analysis: 0.00 0 0 0.00 -
23.48/23.57 c B&B Tree :
23.48/23.57 c number of runs : 1
23.48/23.57 c nodes : 307
23.48/23.57 c nodes (total) : 307
23.48/23.57 c nodes left : 0
23.48/23.57 c max depth : 49
23.48/23.57 c max depth (total): 49
23.48/23.57 c backtracks : 77 (25.1%)
23.48/23.57 c delayed cutoffs : 0
23.48/23.57 c repropagations : 89 (114 domain reductions, 0 cutoffs)
23.48/23.57 c avg switch length: 3.98
23.48/23.57 c switching time : 0.80
23.48/23.57 c Solution :
23.48/23.57 c Solutions found : 0 (0 improvements)
23.48/23.57 c Primal Bound : infeasible
23.48/23.57 c Dual Bound : -
23.48/23.57 c Gap : 0.00 %
23.48/23.57 c Root Dual Bound : +3.00000000000000e+01
23.48/23.60 c Time complete: 23.56.