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-1870633-1245214436.opb>
0.00/0.02 c original problem has 1566 variables (1566 bin, 0 int, 0 impl, 0 cont) and 1618 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, 11828 impls, 100 clqs
0.19/0.29 c presolving (2 rounds):
0.19/0.29 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.19/0.29 c 11828 implications, 100 cliques
0.19/0.29 c presolved problem has 1566 variables (1566 bin, 0 int, 0 impl, 0 cont) and 1618 constraints
0.19/0.29 c 1 constraints of type <knapsack>
0.19/0.29 c 100 constraints of type <setppc>
0.19/0.29 c 1466 constraints of type <and>
0.19/0.29 c 1 constraints of type <linear>
0.19/0.29 c 50 constraints of type <logicor>
0.19/0.29 c transformed objective value is always integral (scale: 1)
0.19/0.29 c Presolving Time: 0.11
0.19/0.29 c SATUNSAT-NLC
0.19/0.29 c -----------------------------------------------------------------------------------------------
0.19/0.29 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.29 c separating/flowcover/freq = c -1
0.19/0.29 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.29 c separating/cmir/freq = c -1
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/veclendiving/maxlpiterofs = c 1500
0.19/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.29 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.19/0.29 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.29 c heuristics/veclendiving/freq = c -1
0.19/0.29 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.29 c heuristics/simplerounding/freq = c -1
0.19/0.29 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.29 c heuristics/shifting/freq = c -1
0.19/0.29 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.29 c heuristics/rounding/freq = c -1
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.19/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.19/0.29 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.19/0.29 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.29 c heuristics/rootsoldiving/freq = c -1
0.19/0.29 c # number of nodes added to the contingent of the total nodes
0.19/0.29 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.19/0.29 c heuristics/rens/nodesofs = c 2000
0.19/0.29 c # minimum percentage of integer variables that have to be fixable
0.19/0.29 c # [type: real, range: [0,1], default: 0.5]
0.19/0.29 c heuristics/rens/minfixingrate = c 0.3
0.19/0.29 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 0]
0.19/0.29 c heuristics/rens/freq = c -1
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.19/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.29 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.19/0.29 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.29 c heuristics/pscostdiving/freq = c -1
0.19/0.29 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 1]
0.19/0.29 c heuristics/oneopt/freq = c -1
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.19/0.29 c # maximal fraction of diving LP iterations compared to total iteration number
0.19/0.29 c # [type: real, range: [0,1], default: 0.01]
0.19/0.29 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.19/0.29 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.29 c heuristics/objpscostdiving/freq = c -1
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.19/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.29 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.19/0.29 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.29 c heuristics/linesearchdiving/freq = c -1
0.19/0.29 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.29 c heuristics/intshifting/freq = c -1
0.19/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.29 c heuristics/intdiving/maxlpiterquot = c 0.075
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/guideddiving/maxlpiterofs = c 1500
0.19/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.29 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.19/0.29 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.29 c heuristics/guideddiving/freq = c -1
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/fracdiving/maxlpiterofs = c 1500
0.19/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.29 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.19/0.29 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.29 c heuristics/fracdiving/freq = c -1
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/feaspump/maxlpiterofs = c 2000
0.19/0.29 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 20]
0.19/0.29 c heuristics/feaspump/freq = c -1
0.19/0.29 c # minimum percentage of integer variables that have to be fixed
0.19/0.29 c # [type: real, range: [0,1], default: 0.666]
0.19/0.29 c heuristics/crossover/minfixingrate = c 0.5
0.19/0.29 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.19/0.29 c # [type: real, range: [0,1], default: 0.1]
0.19/0.29 c heuristics/crossover/nodesquot = c 0.15
0.19/0.29 c # number of nodes without incumbent change that heuristic should wait
0.19/0.29 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.19/0.29 c heuristics/crossover/nwaitingnodes = c 100
0.19/0.29 c # number of nodes added to the contingent of the total nodes
0.19/0.29 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.19/0.29 c heuristics/crossover/nodesofs = c 750
0.19/0.29 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 30]
0.19/0.29 c heuristics/crossover/freq = c -1
0.19/0.29 c # additional number of allowed LP iterations
0.19/0.29 c # [type: int, range: [0,2147483647], default: 1000]
0.19/0.29 c heuristics/coefdiving/maxlpiterofs = c 1500
0.19/0.29 c # maximal fraction of diving LP iterations compared to node LP iterations
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.19/0.29 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.19/0.29 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 10]
0.19/0.29 c heuristics/coefdiving/freq = c -1
0.19/0.29 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.29 c presolving/probing/maxrounds = c 0
0.19/0.29 c # should presolving try to simplify knapsacks
0.19/0.29 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.29 c constraints/knapsack/simplifyinequalities = c TRUE
0.19/0.29 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.19/0.29 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.19/0.29 c constraints/knapsack/disaggregation = c FALSE
0.19/0.29 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.29 c constraints/knapsack/maxnumcardlift = c 0
0.19/0.29 c # should presolving try to simplify inequalities
0.19/0.29 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.19/0.29 c constraints/linear/simplifyinequalities = c TRUE
0.19/0.29 c # maximal number of separation rounds in the root node (-1: unlimited)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.29 c separating/maxroundsroot = c 5
0.19/0.29 c # maximal number of separation rounds per node (-1: unlimited)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 5]
0.19/0.29 c separating/maxrounds = c 1
0.19/0.29 c # solving stops, if the given number of solutions were found (-1: no limit)
0.19/0.29 c # [type: int, range: [-1,2147483647], default: -1]
0.19/0.29 c limits/solutions = c 1
0.19/0.29 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.29 c limits/memory = c 1620
0.19/0.29 c # maximal time in seconds to run
0.19/0.29 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.19/0.29 c limits/time = c 1791
0.19/0.29 c # frequency for displaying node information lines
0.19/0.29 c # [type: int, range: [-1,2147483647], default: 100]
0.19/0.29 c display/freq = c 10000
0.19/0.29 c -----------------------------------------------------------------------------------------------
0.19/0.29 c start solving problem
0.19/0.29 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.1s| 1 | 0 | 67 |7053k| 0 | 60 |1566 |1618 |1618 |1566 |3084 | 0 | 0 | 0 | 3.000000e+01 | -- | Inf
0.49/0.52 c 0.3s| 1 | 0 | 104 |7073k| 0 | 61 |1566 |1618 |1618 |1566 |3085 | 1 | 0 | 0 | 3.000000e+01 | -- | Inf
0.59/0.69 c 0.5s| 1 | 0 | 148 |7102k| 0 | 62 |1566 |1618 |1618 |1566 |3086 | 2 | 0 | 0 | 3.000000e+01 | -- | Inf
0.99/1.09 c 0.9s| 1 | 0 | 166 |7148k| 0 | 66 |1566 |1618 |1618 |1566 |3087 | 3 | 0 | 0 | 3.000000e+01 | -- | Inf
1.59/1.64 c 1.4s| 1 | 0 | 170 |7210k| 0 | 68 |1566 |1618 |1618 |1566 |3088 | 4 | 0 | 0 | 3.000000e+01 | -- | Inf
2.10/2.20 c 2.0s| 1 | 0 | 174 |7263k| 0 | 70 |1566 |1618 |1618 |1566 |3089 | 5 | 0 | 0 | 3.000000e+01 | -- | Inf
3.19/3.21 c 3.0s| 1 | 2 | 174 |7264k| 0 | 70 |1566 |1618 |1618 |1566 |3089 | 5 | 0 | 17 | 3.000000e+01 | -- | Inf
19.19/19.23 c
19.19/19.23 c SCIP Status : problem is solved [infeasible]
19.19/19.23 c Solving Time (sec) : 18.94
19.19/19.23 c Solving Nodes : 359
19.19/19.23 c Primal Bound : +1.00000000000000e+20 (0 solutions)
19.19/19.23 c Dual Bound : +1.00000000000000e+20
19.19/19.23 c Gap : 0.00 %
19.19/19.23 c NODE 359
19.19/19.23 c DUAL BOUND 1e+20
19.19/19.23 c PRIMAL BOUND 1e+20
19.19/19.23 c GAP 0
19.19/19.23 s UNSATISFIABLE
19.19/19.23 c SCIP Status : problem is solved [infeasible]
19.19/19.23 c Solving Time : 18.94
19.19/19.23 c Original Problem :
19.19/19.23 c Problem name : HOME/instance-1870633-1245214436.opb
19.19/19.23 c Variables : 1566 (1566 binary, 0 integer, 0 implicit integer, 0 continuous)
19.19/19.23 c Constraints : 1618 initial, 1618 maximal
19.19/19.23 c Presolved Problem :
19.19/19.23 c Problem name : t_HOME/instance-1870633-1245214436.opb
19.19/19.23 c Variables : 1566 (1566 binary, 0 integer, 0 implicit integer, 0 continuous)
19.19/19.23 c Constraints : 1618 initial, 1618 maximal
19.19/19.23 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
19.19/19.23 c trivial : 0.00 0 0 0 0 0 0 0 0
19.19/19.23 c dualfix : 0.00 0 0 0 0 0 0 0 0
19.19/19.23 c boundshift : 0.00 0 0 0 0 0 0 0 0
19.19/19.23 c inttobinary : 0.00 0 0 0 0 0 0 0 0
19.19/19.23 c implics : 0.00 0 0 0 0 0 0 0 0
19.19/19.23 c probing : 0.00 0 0 0 0 0 0 0 0
19.19/19.23 c knapsack : 0.00 0 0 0 0 0 0 0 0
19.19/19.23 c setppc : 0.00 0 0 0 0 0 0 0 0
19.19/19.23 c and : 0.10 0 0 0 0 0 0 0 0
19.19/19.23 c linear : 0.01 0 0 0 0 0 0 0 0
19.19/19.23 c logicor : 0.00 0 0 0 0 0 0 0 0
19.19/19.23 c root node : - 129 - - 129 - - - -
19.19/19.23 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
19.19/19.23 c integral : 0 0 0 235 0 4 73 0 0 358
19.19/19.23 c knapsack : 1 5 919 23 0 3 84 0 0 0
19.19/19.23 c setppc : 100 5 917 23 0 2 1514 0 0 0
19.19/19.23 c and : 1466 332 915 23 0 1 31706 39303 0 0
19.19/19.23 c linear : 1 5 914 0 0 4 14 0 0 0
19.19/19.23 c logicor : 50+ 5 301 0 0 1 169 0 0 0
19.19/19.23 c countsols : 0 0 0 0 0 0 0 0 0 0
19.19/19.23 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
19.19/19.23 c integral : 8.87 0.00 0.00 8.87 0.00
19.19/19.23 c knapsack : 0.00 0.00 0.00 0.00 0.00
19.19/19.23 c setppc : 0.01 0.00 0.01 0.00 0.00
19.19/19.23 c and : 0.49 0.34 0.13 0.02 0.00
19.19/19.23 c linear : 0.03 0.00 0.03 0.00 0.00
19.19/19.23 c logicor : 0.00 0.00 0.00 0.00 0.00
19.19/19.23 c countsols : 0.00 0.00 0.00 0.00 0.00
19.19/19.23 c Propagators : Time Calls Cutoffs DomReds
19.19/19.23 c rootredcost : 0.00 0 0 0
19.19/19.23 c pseudoobj : 0.04 930 1 0
19.19/19.23 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
19.19/19.23 c propagation : 0.00 11 11 14 15.1 0 0.0 -
19.19/19.23 c infeasible LP : 0.08 164 0 0 0.0 0 0.0 0
19.19/19.23 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
19.19/19.23 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
19.19/19.23 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
19.19/19.23 c applied globally : - - - 11 14.9 - - -
19.19/19.23 c applied locally : - - - 0 0.0 - - -
19.19/19.23 c Separators : Time Calls Cutoffs DomReds Cuts Conss
19.19/19.23 c cut pool : 0.00 4 - - 9 - (maximal pool size: 40)
19.19/19.23 c redcost : 0.05 332 0 0 0 0
19.19/19.23 c impliedbounds : 0.00 5 0 0 0 0
19.19/19.23 c intobj : 0.00 0 0 0 0 0
19.19/19.23 c gomory : 1.28 5 0 0 1006 0
19.19/19.23 c strongcg : 0.46 5 0 0 2500 0
19.19/19.23 c cmir : 0.00 0 0 0 0 0
19.19/19.23 c flowcover : 0.00 0 0 0 0 0
19.19/19.23 c clique : 0.00 5 0 0 0 0
19.19/19.23 c zerohalf : 0.00 0 0 0 0 0
19.19/19.23 c mcf : 0.03 2 0 0 0 0
19.19/19.23 c Pricers : Time Calls Vars
19.19/19.23 c problem variables: 0.00 0 0
19.19/19.23 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
19.19/19.23 c relpscost : 8.87 212 4 73 0 0 358
19.19/19.23 c pscost : 0.00 0 0 0 0 0 0
19.19/19.23 c inference : 0.00 0 0 0 0 0 0
19.19/19.23 c mostinf : 0.00 0 0 0 0 0 0
19.19/19.23 c leastinf : 0.00 0 0 0 0 0 0
19.19/19.23 c fullstrong : 0.00 0 0 0 0 0 0
19.19/19.23 c allfullstrong : 0.00 0 0 0 0 0 0
19.19/19.23 c random : 0.00 0 0 0 0 0 0
19.19/19.23 c Primal Heuristics : Time Calls Found
19.19/19.23 c LP solutions : 0.00 - 0
19.19/19.23 c pseudo solutions : 0.00 - 0
19.19/19.23 c simplerounding : 0.00 0 0
19.19/19.23 c rounding : 0.00 0 0
19.19/19.23 c shifting : 0.00 0 0
19.19/19.23 c intshifting : 0.00 0 0
19.19/19.23 c oneopt : 0.00 0 0
19.19/19.23 c fixandinfer : 0.00 0 0
19.19/19.23 c feaspump : 0.00 0 0
19.19/19.23 c coefdiving : 0.00 0 0
19.19/19.23 c pscostdiving : 0.00 0 0
19.19/19.23 c fracdiving : 0.00 0 0
19.19/19.23 c veclendiving : 0.00 0 0
19.19/19.23 c intdiving : 0.00 0 0
19.19/19.23 c actconsdiving : 0.00 0 0
19.19/19.23 c objpscostdiving : 0.00 0 0
19.19/19.23 c rootsoldiving : 0.00 0 0
19.19/19.23 c linesearchdiving : 0.00 0 0
19.19/19.23 c guideddiving : 0.00 0 0
19.19/19.23 c octane : 0.00 0 0
19.19/19.23 c rens : 0.00 0 0
19.19/19.23 c rins : 0.00 0 0
19.19/19.23 c localbranching : 0.00 0 0
19.19/19.23 c mutation : 0.00 0 0
19.19/19.23 c crossover : 0.00 0 0
19.19/19.23 c dins : 0.00 0 0
19.19/19.23 c LP : Time Calls Iterations Iter/call Iter/sec
19.19/19.23 c primal LP : 0.68 0 0 0.00 0.00
19.19/19.23 c dual LP : 6.08 717 43885 61.21 7217.93
19.19/19.23 c barrier LP : 0.00 0 0 0.00 -
19.19/19.23 c diving/probing LP: 0.00 0 0 0.00 -
19.19/19.23 c strong branching : 8.82 1482 70787 47.76 8025.74
19.19/19.23 c (at root node) : - 17 2183 128.41 -
19.19/19.23 c conflict analysis: 0.00 0 0 0.00 -
19.19/19.23 c B&B Tree :
19.19/19.23 c number of runs : 1
19.19/19.23 c nodes : 359
19.19/19.23 c nodes (total) : 359
19.19/19.23 c nodes left : 0
19.19/19.23 c max depth : 44
19.19/19.23 c max depth (total): 44
19.19/19.23 c backtracks : 69 (19.2%)
19.19/19.23 c delayed cutoffs : 0
19.19/19.23 c repropagations : 12 (75 domain reductions, 0 cutoffs)
19.19/19.23 c avg switch length: 2.96
19.19/19.23 c switching time : 0.77
19.19/19.23 c Solution :
19.19/19.23 c Solutions found : 0 (0 improvements)
19.19/19.23 c Primal Bound : infeasible
19.19/19.23 c Dual Bound : -
19.19/19.23 c Gap : 0.00 %
19.19/19.23 c Root Dual Bound : +3.00000000000000e+01
19.19/19.25 c Time complete: 19.24.