0.00/0.02 c SCIP version 1.1.0.7
0.00/0.02 c LP-Solver SoPlex 1.4.1
0.00/0.02 c user parameter file <scip.set> not found - using default parameters
0.00/0.02 c read problem <HOME/instance-1870686-1245215724.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.04 c No objective function, only one solution is needed.
0.00/0.04 c start presolving problem
0.00/0.04 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.19/0.30 c presolving (2 rounds):
0.19/0.30 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.19/0.30 c 11812 implications, 100 cliques
0.19/0.30 c presolved problem has 1564 variables (1564 bin, 0 int, 0 impl, 0 cont) and 1616 constraints
0.19/0.30 c 1 constraints of type <knapsack>
0.19/0.30 c 100 constraints of type <setppc>
0.29/0.30 c 1464 constraints of type <and>
0.29/0.30 c 1 constraints of type <linear>
0.29/0.30 c 50 constraints of type <logicor>
0.29/0.30 c transformed objective value is always integral (scale: 1)
0.29/0.30 c Presolving Time: 0.11
0.29/0.30 c SATUNSAT-NLC
0.29/0.30 c -----------------------------------------------------------------------------------------------
0.29/0.30 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.30 c separating/flowcover/freq = c -1
0.29/0.30 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.30 c separating/cmir/freq = c -1
0.29/0.30 c # additional number of allowed LP iterations
0.29/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.30 c heuristics/veclendiving/maxlpiterofs = c 1500
0.29/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.30 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.29/0.30 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.30 c heuristics/veclendiving/freq = c -1
0.29/0.30 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.30 c heuristics/simplerounding/freq = c -1
0.29/0.30 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.30 c heuristics/shifting/freq = c -1
0.29/0.30 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.30 c heuristics/rounding/freq = c -1
0.29/0.30 c # additional number of allowed LP iterations
0.29/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.30 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.29/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.30 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.29/0.30 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.30 c heuristics/rootsoldiving/freq = c -1
0.29/0.30 c # number of nodes added to the contingent of the total nodes
0.29/0.30 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.30 c heuristics/rens/nodesofs = c 2000
0.29/0.30 c # minimum percentage of integer variables that have to be fixable
0.29/0.30 c # [type: real, range: [0,1], default: 0.5]
0.29/0.30 c heuristics/rens/minfixingrate = c 0.3
0.29/0.30 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.30 c heuristics/rens/freq = c -1
0.29/0.30 c # additional number of allowed LP iterations
0.29/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.30 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.29/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.30 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.29/0.30 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.30 c heuristics/pscostdiving/freq = c -1
0.29/0.30 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.30 c heuristics/oneopt/freq = c -1
0.29/0.30 c # additional number of allowed LP iterations
0.29/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.30 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.29/0.30 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.30 c # [type: real, range: [0,1], default: 0.01]
0.29/0.30 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.29/0.30 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.30 c heuristics/objpscostdiving/freq = c -1
0.29/0.30 c # additional number of allowed LP iterations
0.29/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.30 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.29/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.30 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.29/0.30 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.30 c heuristics/linesearchdiving/freq = c -1
0.29/0.30 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.30 c heuristics/intshifting/freq = c -1
0.29/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.30 c heuristics/intdiving/maxlpiterquot = c 0.075
0.29/0.30 c # additional number of allowed LP iterations
0.29/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.30 c heuristics/guideddiving/maxlpiterofs = c 1500
0.29/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.30 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.29/0.30 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.30 c heuristics/guideddiving/freq = c -1
0.29/0.30 c # additional number of allowed LP iterations
0.29/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.30 c heuristics/fracdiving/maxlpiterofs = c 1500
0.29/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.30 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.29/0.30 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.30 c heuristics/fracdiving/freq = c -1
0.29/0.30 c # additional number of allowed LP iterations
0.29/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.30 c heuristics/feaspump/maxlpiterofs = c 2000
0.29/0.30 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.30 c heuristics/feaspump/freq = c -1
0.29/0.30 c # minimum percentage of integer variables that have to be fixed
0.29/0.30 c # [type: real, range: [0,1], default: 0.666]
0.29/0.30 c heuristics/crossover/minfixingrate = c 0.5
0.29/0.30 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.30 c # [type: real, range: [0,1], default: 0.1]
0.29/0.30 c heuristics/crossover/nodesquot = c 0.15
0.29/0.30 c # number of nodes without incumbent change that heuristic should wait
0.29/0.30 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.30 c heuristics/crossover/nwaitingnodes = c 100
0.29/0.30 c # number of nodes added to the contingent of the total nodes
0.29/0.30 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.30 c heuristics/crossover/nodesofs = c 750
0.29/0.30 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.30 c heuristics/crossover/freq = c -1
0.29/0.30 c # additional number of allowed LP iterations
0.29/0.30 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.30 c heuristics/coefdiving/maxlpiterofs = c 1500
0.29/0.30 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.30 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.29/0.30 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.30 c heuristics/coefdiving/freq = c -1
0.29/0.30 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.30 c presolving/probing/maxrounds = c 0
0.29/0.30 c # should presolving try to simplify knapsacks
0.29/0.30 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.30 c constraints/knapsack/simplifyinequalities = c TRUE
0.29/0.30 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.30 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.30 c constraints/knapsack/disaggregation = c FALSE
0.29/0.30 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.30 c constraints/knapsack/maxnumcardlift = c 0
0.29/0.30 c # should presolving try to simplify inequalities
0.29/0.30 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.30 c constraints/linear/simplifyinequalities = c TRUE
0.29/0.30 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.30 c separating/maxroundsroot = c 5
0.29/0.30 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.30 c separating/maxrounds = c 1
0.29/0.30 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.30 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.30 c limits/solutions = c 1
0.29/0.30 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.30 c limits/memory = c 1620
0.29/0.30 c # maximal time in seconds to run
0.29/0.30 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.30 c limits/time = c 1791
0.29/0.30 c # frequency for displaying node information lines
0.29/0.30 c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.30 c display/freq = c 10000
0.29/0.30 c -----------------------------------------------------------------------------------------------
0.29/0.30 c start solving problem
0.29/0.30 c
0.29/0.34 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.34 c 0.2s| 1 | 0 | 96 |7044k| 0 | 60 |1564 |1616 |1616 |1564 |3080 | 0 | 0 | 0 | 3.000000e+01 | -- | Inf
0.49/0.53 c 0.3s| 1 | 0 | 102 |7058k| 0 | 61 |1564 |1616 |1616 |1564 |3081 | 1 | 0 | 0 | 3.000000e+01 | -- | Inf
0.69/0.72 c 0.5s| 1 | 0 | 123 |7087k| 0 | 62 |1564 |1616 |1616 |1564 |3082 | 2 | 0 | 0 | 3.000000e+01 | -- | Inf
0.88/0.92 c 0.7s| 1 | 0 | 173 |7105k| 0 | 62 |1564 |1616 |1616 |1564 |3083 | 3 | 0 | 0 | 3.000000e+01 | -- | Inf
1.38/1.42 c 1.2s| 1 | 0 | 200 |7127k| 0 | 63 |1564 |1616 |1616 |1564 |3084 | 4 | 0 | 0 | 3.000000e+01 | -- | Inf
1.89/1.96 c 1.7s| 1 | 0 | 234 |7141k| 0 | 63 |1564 |1616 |1616 |1564 |3085 | 5 | 0 | 0 | 3.000000e+01 | -- | Inf
7.28/7.34 c 7.1s| 1 | 2 | 234 |7141k| 0 | 63 |1564 |1616 |1616 |1564 |3085 | 5 | 0 | 18 | 3.000000e+01 | -- | Inf
17.96/18.02 c
17.96/18.02 c SCIP Status : problem is solved [infeasible]
17.96/18.02 c Solving Time (sec) : 17.60
17.96/18.02 c Solving Nodes : 250
17.96/18.02 c Primal Bound : +1.00000000000000e+20 (0 solutions)
17.96/18.02 c Dual Bound : +1.00000000000000e+20
17.96/18.02 c Gap : 0.00 %
17.96/18.02 c NODE 250
17.96/18.02 c DUAL BOUND 1e+20
17.96/18.02 c PRIMAL BOUND 1e+20
17.96/18.02 c GAP 0
17.96/18.02 s UNSATISFIABLE
17.96/18.02 c SCIP Status : problem is solved [infeasible]
17.96/18.02 c Solving Time : 17.60
17.96/18.02 c Original Problem :
17.96/18.02 c Problem name : HOME/instance-1870686-1245215724.opb
17.96/18.02 c Variables : 1564 (1564 binary, 0 integer, 0 implicit integer, 0 continuous)
17.96/18.02 c Constraints : 1616 initial, 1616 maximal
17.96/18.02 c Presolved Problem :
17.96/18.02 c Problem name : t_HOME/instance-1870686-1245215724.opb
17.96/18.02 c Variables : 1564 (1564 binary, 0 integer, 0 implicit integer, 0 continuous)
17.96/18.02 c Constraints : 1616 initial, 1704 maximal
17.96/18.02 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
17.96/18.02 c trivial : 0.00 0 0 0 0 0 0 0 0
17.96/18.02 c dualfix : 0.00 0 0 0 0 0 0 0 0
17.96/18.02 c boundshift : 0.00 0 0 0 0 0 0 0 0
17.96/18.02 c inttobinary : 0.00 0 0 0 0 0 0 0 0
17.96/18.02 c implics : 0.00 0 0 0 0 0 0 0 0
17.96/18.02 c probing : 0.00 0 0 0 0 0 0 0 0
17.96/18.02 c knapsack : 0.00 0 0 0 0 0 0 0 0
17.96/18.02 c setppc : 0.00 0 0 0 0 0 0 0 0
17.96/18.02 c and : 0.10 0 0 0 0 0 0 0 0
17.96/18.02 c linear : 0.01 0 0 0 0 0 0 0 0
17.96/18.02 c logicor : 0.00 0 0 0 0 0 0 0 0
17.96/18.02 c root node : - 71 - - 71 - - - -
17.96/18.02 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
17.96/18.02 c integral : 0 0 0 171 0 2 67 0 0 268
17.96/18.02 c knapsack : 1 5 1081 10 0 15 95 0 0 0
17.96/18.02 c setppc : 100 5 1073 10 0 2 1573 0 0 0
17.96/18.02 c and : 1464 223 1071 10 0 1 26180 25316 0 0
17.96/18.02 c linear : 1 5 1070 0 0 4 13 0 0 0
17.96/18.02 c logicor : 50+ 5 320 0 0 2 226 0 0 0
17.96/18.02 c countsols : 0 0 0 0 0 0 0 0 0 0
17.96/18.02 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
17.96/18.02 c integral : 11.55 0.00 0.00 11.55 0.00
17.96/18.02 c knapsack : 0.00 0.00 0.00 0.00 0.00
17.96/18.02 c setppc : 0.02 0.00 0.02 0.00 0.00
17.96/18.02 c and : 0.33 0.25 0.08 0.00 0.00
17.96/18.02 c linear : 0.03 0.00 0.03 0.00 0.00
17.96/18.02 c logicor : 0.00 0.00 0.00 0.00 0.00
17.96/18.02 c countsols : 0.00 0.00 0.00 0.00 0.00
17.96/18.02 c Propagators : Time Calls Cutoffs DomReds
17.96/18.02 c rootredcost : 0.00 0 0 0
17.96/18.02 c pseudoobj : 0.14 1091 1 0
17.96/18.02 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
17.96/18.03 c propagation : 0.01 24 23 88 18.1 0 0.0 -
17.96/18.03 c infeasible LP : 0.03 82 81 349 19.0 3 19.0 0
17.96/18.03 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
17.96/18.03 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
17.96/18.03 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
17.96/18.03 c applied globally : - - - 161 17.4 - - -
17.96/18.03 c applied locally : - - - 0 0.0 - - -
17.96/18.03 c Separators : Time Calls Cutoffs DomReds Cuts Conss
17.96/18.03 c cut pool : 0.00 4 - - 5 - (maximal pool size: 20)
17.96/18.03 c redcost : 0.03 223 0 0 0 0
17.96/18.03 c impliedbounds : 0.00 5 0 0 0 0
17.96/18.03 c intobj : 0.00 0 0 0 0 0
17.96/18.03 c gomory : 0.82 5 0 0 1500 0
17.96/18.03 c strongcg : 0.65 5 0 0 2032 0
17.96/18.03 c cmir : 0.00 0 0 0 0 0
17.96/18.03 c flowcover : 0.00 0 0 0 0 0
17.96/18.03 c clique : 0.00 5 0 0 0 0
17.96/18.03 c zerohalf : 0.00 0 0 0 0 0
17.96/18.03 c mcf : 0.02 2 0 0 0 0
17.96/18.03 c Pricers : Time Calls Vars
17.96/18.03 c problem variables: 0.00 0 0
17.96/18.03 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
17.96/18.03 c relpscost : 11.55 161 2 67 0 0 268
17.96/18.03 c pscost : 0.00 0 0 0 0 0 0
17.96/18.03 c inference : 0.00 0 0 0 0 0 0
17.96/18.03 c mostinf : 0.00 0 0 0 0 0 0
17.96/18.03 c leastinf : 0.00 0 0 0 0 0 0
17.96/18.03 c fullstrong : 0.00 0 0 0 0 0 0
17.96/18.03 c allfullstrong : 0.00 0 0 0 0 0 0
17.96/18.03 c random : 0.00 0 0 0 0 0 0
17.96/18.03 c Primal Heuristics : Time Calls Found
17.96/18.03 c LP solutions : 0.00 - 0
17.96/18.03 c pseudo solutions : 0.00 - 0
17.96/18.03 c simplerounding : 0.00 0 0
17.96/18.03 c rounding : 0.00 0 0
17.96/18.03 c shifting : 0.00 0 0
17.96/18.03 c intshifting : 0.00 0 0
17.96/18.03 c oneopt : 0.00 0 0
17.96/18.03 c fixandinfer : 0.00 0 0
17.96/18.03 c feaspump : 0.00 0 0
17.96/18.03 c coefdiving : 0.00 0 0
17.96/18.03 c pscostdiving : 0.00 0 0
17.96/18.03 c fracdiving : 0.00 0 0
17.96/18.03 c veclendiving : 0.00 0 0
17.96/18.03 c intdiving : 0.00 0 0
17.96/18.03 c actconsdiving : 0.00 0 0
17.96/18.03 c objpscostdiving : 0.00 0 0
17.96/18.03 c rootsoldiving : 0.00 0 0
17.96/18.03 c linesearchdiving : 0.00 0 0
17.96/18.03 c guideddiving : 0.00 0 0
17.96/18.03 c octane : 0.00 0 0
17.96/18.03 c rens : 0.00 0 0
17.96/18.03 c rins : 0.00 0 0
17.96/18.03 c localbranching : 0.00 0 0
17.96/18.03 c mutation : 0.00 0 0
17.96/18.03 c crossover : 0.00 0 0
17.96/18.03 c dins : 0.00 0 0
17.96/18.03 c LP : Time Calls Iterations Iter/call Iter/sec
17.96/18.03 c primal LP : 0.05 0 0 0.00 0.00
17.96/18.03 c dual LP : 3.20 472 20450 43.33 6390.62
17.96/18.03 c barrier LP : 0.00 0 0 0.00 -
17.96/18.03 c diving/probing LP: 0.00 0 0 0.00 -
17.96/18.03 c strong branching : 11.53 1247 45024 36.11 3904.94
17.96/18.03 c (at root node) : - 18 9713 539.61 -
17.96/18.03 c conflict analysis: 0.00 0 0 0.00 -
17.96/18.03 c B&B Tree :
17.96/18.03 c number of runs : 1
17.96/18.03 c nodes : 250
17.96/18.03 c nodes (total) : 250
17.96/18.03 c nodes left : 0
17.96/18.03 c max depth : 46
17.96/18.03 c max depth (total): 46
17.96/18.03 c backtracks : 60 (24.0%)
17.96/18.03 c delayed cutoffs : 19
17.96/18.03 c repropagations : 354 (4196 domain reductions, 5 cutoffs)
17.96/18.03 c avg switch length: 4.60
17.96/18.03 c switching time : 0.23
17.96/18.03 c Solution :
17.96/18.03 c Solutions found : 0 (0 improvements)
17.96/18.03 c Primal Bound : infeasible
17.96/18.03 c Dual Bound : -
17.96/18.03 c Gap : 0.00 %
17.96/18.03 c Root Dual Bound : +3.00000000000000e+01
17.96/18.05 c Time complete: 18.02.