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-1870600-1245213348.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.10/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.36 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.36 c 0.2s| 1 | 0 | 106 |7117k| 0 | 60 |1580 |1632 |1632 |1580 |3112 | 0 | 0 | 0 | 3.000000e+01 | -- | Inf
0.49/0.55 c 0.3s| 1 | 0 | 111 |7131k| 0 | 61 |1580 |1632 |1632 |1580 |3113 | 1 | 0 | 0 | 3.000000e+01 | -- | Inf
0.69/0.76 c 0.6s| 1 | 0 | 122 |7163k| 0 | 62 |1580 |1632 |1632 |1580 |3114 | 2 | 0 | 0 | 3.000000e+01 | -- | Inf
0.89/0.96 c 0.8s| 1 | 0 | 149 |7173k| 0 | 62 |1580 |1632 |1632 |1580 |3115 | 3 | 0 | 0 | 3.000000e+01 | -- | Inf
1.39/1.48 c 1.2s| 1 | 0 | 179 |7188k| 0 | 63 |1580 |1632 |1632 |1580 |3116 | 4 | 0 | 0 | 3.000000e+01 | -- | Inf
1.99/2.08 c 1.9s| 1 | 0 | 249 |7217k| 0 | 63 |1580 |1632 |1632 |1580 |3117 | 5 | 0 | 0 | 3.000000e+01 | -- | Inf
8.19/8.29 c 8.0s| 1 | 2 | 249 |7217k| 0 | 63 |1580 |1632 |1632 |1580 |3117 | 5 | 0 | 19 | 3.000000e+01 | -- | Inf
18.08/18.12 c
18.08/18.12 c SCIP Status : problem is solved [infeasible]
18.08/18.12 c Solving Time (sec) : 17.71
18.08/18.12 c Solving Nodes : 232
18.08/18.12 c Primal Bound : +1.00000000000000e+20 (0 solutions)
18.08/18.12 c Dual Bound : +1.00000000000000e+20
18.08/18.12 c Gap : 0.00 %
18.08/18.12 c NODE 232
18.08/18.12 c DUAL BOUND 1e+20
18.08/18.12 c PRIMAL BOUND 1e+20
18.08/18.12 c GAP 0
18.08/18.12 s UNSATISFIABLE
18.08/18.12 c SCIP Status : problem is solved [infeasible]
18.08/18.12 c Solving Time : 17.71
18.08/18.12 c Original Problem :
18.08/18.12 c Problem name : HOME/instance-1870600-1245213348.opb
18.08/18.12 c Variables : 1580 (1580 binary, 0 integer, 0 implicit integer, 0 continuous)
18.08/18.12 c Constraints : 1632 initial, 1632 maximal
18.08/18.12 c Presolved Problem :
18.08/18.12 c Problem name : t_HOME/instance-1870600-1245213348.opb
18.08/18.12 c Variables : 1580 (1580 binary, 0 integer, 0 implicit integer, 0 continuous)
18.08/18.12 c Constraints : 1632 initial, 1635 maximal
18.08/18.12 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
18.08/18.12 c trivial : 0.00 0 0 0 0 0 0 0 0
18.08/18.12 c dualfix : 0.00 0 0 0 0 0 0 0 0
18.08/18.12 c boundshift : 0.00 0 0 0 0 0 0 0 0
18.08/18.12 c inttobinary : 0.00 0 0 0 0 0 0 0 0
18.08/18.12 c implics : 0.00 0 0 0 0 0 0 0 0
18.08/18.12 c probing : 0.00 0 0 0 0 0 0 0 0
18.08/18.12 c knapsack : 0.00 0 0 0 0 0 0 0 0
18.08/18.12 c setppc : 0.00 0 0 0 0 0 0 0 0
18.08/18.12 c and : 0.09 0 0 0 0 0 0 0 0
18.08/18.12 c linear : 0.01 0 0 0 0 0 0 0 0
18.08/18.12 c logicor : 0.00 0 0 0 0 0 0 0 0
18.08/18.12 c root node : - 188 - - 188 - - - -
18.08/18.12 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
18.08/18.12 c integral : 0 0 0 167 0 3 53 0 0 240
18.08/18.12 c knapsack : 1 5 870 17 0 7 42 0 0 0
18.08/18.12 c setppc : 100 5 865 17 0 0 846 0 0 0
18.08/18.12 c and : 1480 216 865 17 0 1 16607 23993 0 0
18.08/18.12 c linear : 1 5 864 0 0 2 0 0 0 0
18.08/18.12 c logicor : 50+ 5 239 0 0 0 179 0 0 0
18.08/18.12 c countsols : 0 0 0 0 0 0 0 0 0 0
18.08/18.12 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
18.08/18.12 c integral : 11.46 0.00 0.00 11.46 0.00
18.08/18.12 c knapsack : 0.00 0.00 0.00 0.00 0.00
18.08/18.12 c setppc : 0.01 0.00 0.01 0.00 0.00
18.08/18.12 c and : 0.28 0.18 0.09 0.01 0.00
18.08/18.12 c linear : 0.01 0.01 0.00 0.00 0.00
18.08/18.12 c logicor : 0.00 0.00 0.00 0.00 0.00
18.08/18.12 c countsols : 0.00 0.00 0.00 0.00 0.00
18.08/18.12 c Propagators : Time Calls Cutoffs DomReds
18.08/18.12 c rootredcost : 0.00 0 0 0
18.08/18.12 c pseudoobj : 0.08 874 1 0
18.08/18.12 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
18.08/18.12 c propagation : 0.00 10 10 28 18.5 0 0.0 -
18.08/18.12 c infeasible LP : 0.04 81 81 276 18.0 1 5.0 0
18.08/18.12 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
18.08/18.12 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
18.08/18.12 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
18.08/18.12 c applied globally : - - - 147 15.0 - - -
18.08/18.12 c applied locally : - - - 0 0.0 - - -
18.08/18.12 c Separators : Time Calls Cutoffs DomReds Cuts Conss
18.08/18.12 c cut pool : 0.00 4 - - 9 - (maximal pool size: 20)
18.08/18.12 c redcost : 0.00 216 0 0 0 0
18.08/18.12 c impliedbounds : 0.00 5 0 0 0 0
18.08/18.12 c intobj : 0.00 0 0 0 0 0
18.08/18.12 c gomory : 0.86 5 0 0 1500 0
18.08/18.12 c strongcg : 0.71 5 0 0 1595 0
18.08/18.12 c cmir : 0.00 0 0 0 0 0
18.08/18.12 c flowcover : 0.00 0 0 0 0 0
18.08/18.12 c clique : 0.00 5 0 0 0 0
18.08/18.12 c zerohalf : 0.00 0 0 0 0 0
18.08/18.12 c mcf : 0.02 2 0 0 0 0
18.08/18.12 c Pricers : Time Calls Vars
18.08/18.12 c problem variables: 0.00 0 0
18.08/18.12 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
18.08/18.12 c relpscost : 11.46 150 3 53 0 0 240
18.08/18.12 c pscost : 0.00 0 0 0 0 0 0
18.08/18.12 c inference : 0.00 0 0 0 0 0 0
18.08/18.12 c mostinf : 0.00 0 0 0 0 0 0
18.08/18.12 c leastinf : 0.00 0 0 0 0 0 0
18.08/18.12 c fullstrong : 0.00 0 0 0 0 0 0
18.08/18.12 c allfullstrong : 0.00 0 0 0 0 0 0
18.08/18.12 c random : 0.00 0 0 0 0 0 0
18.08/18.12 c Primal Heuristics : Time Calls Found
18.08/18.12 c LP solutions : 0.00 - 0
18.08/18.12 c pseudo solutions : 0.00 - 0
18.08/18.12 c simplerounding : 0.00 0 0
18.08/18.12 c rounding : 0.00 0 0
18.08/18.12 c shifting : 0.00 0 0
18.08/18.12 c intshifting : 0.00 0 0
18.08/18.12 c oneopt : 0.00 0 0
18.08/18.12 c fixandinfer : 0.00 0 0
18.08/18.12 c feaspump : 0.00 0 0
18.08/18.12 c coefdiving : 0.00 0 0
18.08/18.12 c pscostdiving : 0.00 0 0
18.08/18.12 c fracdiving : 0.00 0 0
18.08/18.12 c veclendiving : 0.00 0 0
18.08/18.12 c intdiving : 0.00 0 0
18.08/18.12 c actconsdiving : 0.00 0 0
18.08/18.12 c objpscostdiving : 0.00 0 0
18.08/18.12 c rootsoldiving : 0.00 0 0
18.08/18.12 c linesearchdiving : 0.00 0 0
18.08/18.12 c guideddiving : 0.00 0 0
18.08/18.12 c octane : 0.00 0 0
18.08/18.12 c rens : 0.00 0 0
18.08/18.12 c rins : 0.00 0 0
18.08/18.12 c localbranching : 0.00 0 0
18.08/18.12 c mutation : 0.00 0 0
18.08/18.12 c crossover : 0.00 0 0
18.08/18.12 c dins : 0.00 0 0
18.08/18.12 c LP : Time Calls Iterations Iter/call Iter/sec
18.08/18.12 c primal LP : 0.05 0 0 0.00 0.00
18.08/18.12 c dual LP : 3.51 466 20760 44.55 5914.53
18.08/18.12 c barrier LP : 0.00 0 0 0.00 -
18.08/18.12 c diving/probing LP: 0.00 0 0 0.00 -
18.08/18.12 c strong branching : 11.46 1084 38650 35.65 3372.60
18.08/18.12 c (at root node) : - 19 10501 552.68 -
18.08/18.12 c conflict analysis: 0.00 0 0 0.00 -
18.08/18.12 c B&B Tree :
18.08/18.12 c number of runs : 1
18.08/18.12 c nodes : 232
18.08/18.12 c nodes (total) : 232
18.08/18.12 c nodes left : 0
18.08/18.12 c max depth : 46
18.08/18.12 c max depth (total): 46
18.08/18.12 c backtracks : 50 (21.6%)
18.08/18.12 c delayed cutoffs : 9
18.08/18.12 c repropagations : 206 (1785 domain reductions, 1 cutoffs)
18.08/18.12 c avg switch length: 3.67
18.08/18.12 c switching time : 0.13
18.08/18.12 c Solution :
18.08/18.12 c Solutions found : 0 (0 improvements)
18.08/18.12 c Primal Bound : infeasible
18.08/18.12 c Dual Bound : -
18.08/18.12 c Gap : 0.00 %
18.08/18.12 c Root Dual Bound : +3.00000000000000e+01
18.08/18.14 c Time complete: 18.13.