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-1870762-1245218386.opb>
0.00/0.02 c original problem has 1598 variables (1598 bin, 0 int, 0 impl, 0 cont) and 1650 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.18 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 12084 impls, 100 clqs
0.29/0.32 c presolving (2 rounds):
0.29/0.32 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.32 c 12084 implications, 100 cliques
0.29/0.32 c presolved problem has 1598 variables (1598 bin, 0 int, 0 impl, 0 cont) and 1650 constraints
0.29/0.32 c 1 constraints of type <knapsack>
0.29/0.32 c 100 constraints of type <setppc>
0.29/0.32 c 1498 constraints of type <and>
0.29/0.32 c 1 constraints of type <linear>
0.29/0.32 c 50 constraints of type <logicor>
0.29/0.32 c transformed objective value is always integral (scale: 1)
0.29/0.32 c Presolving Time: 0.11
0.29/0.32 c SATUNSAT-NLC
0.29/0.32 c -----------------------------------------------------------------------------------------------
0.29/0.32 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.32 c separating/flowcover/freq = c -1
0.29/0.32 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.32 c separating/cmir/freq = c -1
0.29/0.32 c # additional number of allowed LP iterations
0.29/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.32 c heuristics/veclendiving/maxlpiterofs = c 1500
0.29/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.32 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.29/0.32 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.32 c heuristics/veclendiving/freq = c -1
0.29/0.32 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.32 c heuristics/simplerounding/freq = c -1
0.29/0.32 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.32 c heuristics/shifting/freq = c -1
0.29/0.32 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.32 c heuristics/rounding/freq = c -1
0.29/0.32 c # additional number of allowed LP iterations
0.29/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.32 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.29/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.32 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.29/0.32 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.32 c heuristics/rootsoldiving/freq = c -1
0.29/0.32 c # number of nodes added to the contingent of the total nodes
0.29/0.32 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.32 c heuristics/rens/nodesofs = c 2000
0.29/0.32 c # minimum percentage of integer variables that have to be fixable
0.29/0.32 c # [type: real, range: [0,1], default: 0.5]
0.29/0.32 c heuristics/rens/minfixingrate = c 0.3
0.29/0.32 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.32 c heuristics/rens/freq = c -1
0.29/0.32 c # additional number of allowed LP iterations
0.29/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.32 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.29/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.32 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.29/0.32 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.32 c heuristics/pscostdiving/freq = c -1
0.29/0.32 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.32 c heuristics/oneopt/freq = c -1
0.29/0.32 c # additional number of allowed LP iterations
0.29/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.32 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.29/0.32 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.32 c # [type: real, range: [0,1], default: 0.01]
0.29/0.32 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.29/0.32 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.32 c heuristics/objpscostdiving/freq = c -1
0.29/0.32 c # additional number of allowed LP iterations
0.29/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.32 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.29/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.32 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.29/0.32 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.32 c heuristics/linesearchdiving/freq = c -1
0.29/0.32 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.32 c heuristics/intshifting/freq = c -1
0.29/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.32 c heuristics/intdiving/maxlpiterquot = c 0.075
0.29/0.32 c # additional number of allowed LP iterations
0.29/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.32 c heuristics/guideddiving/maxlpiterofs = c 1500
0.29/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.32 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.29/0.32 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.32 c heuristics/guideddiving/freq = c -1
0.29/0.32 c # additional number of allowed LP iterations
0.29/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.32 c heuristics/fracdiving/maxlpiterofs = c 1500
0.29/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.32 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.29/0.32 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.32 c heuristics/fracdiving/freq = c -1
0.29/0.32 c # additional number of allowed LP iterations
0.29/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.32 c heuristics/feaspump/maxlpiterofs = c 2000
0.29/0.32 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.32 c heuristics/feaspump/freq = c -1
0.29/0.32 c # minimum percentage of integer variables that have to be fixed
0.29/0.32 c # [type: real, range: [0,1], default: 0.666]
0.29/0.32 c heuristics/crossover/minfixingrate = c 0.5
0.29/0.32 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.32 c # [type: real, range: [0,1], default: 0.1]
0.29/0.32 c heuristics/crossover/nodesquot = c 0.15
0.29/0.32 c # number of nodes without incumbent change that heuristic should wait
0.29/0.32 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.32 c heuristics/crossover/nwaitingnodes = c 100
0.29/0.32 c # number of nodes added to the contingent of the total nodes
0.29/0.32 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.32 c heuristics/crossover/nodesofs = c 750
0.29/0.32 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.32 c heuristics/crossover/freq = c -1
0.29/0.32 c # additional number of allowed LP iterations
0.29/0.32 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.32 c heuristics/coefdiving/maxlpiterofs = c 1500
0.29/0.32 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.32 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.29/0.32 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.32 c heuristics/coefdiving/freq = c -1
0.29/0.32 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.32 c presolving/probing/maxrounds = c 0
0.29/0.32 c # should presolving try to simplify knapsacks
0.29/0.32 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.32 c constraints/knapsack/simplifyinequalities = c TRUE
0.29/0.32 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.32 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.32 c constraints/knapsack/disaggregation = c FALSE
0.29/0.32 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.32 c constraints/knapsack/maxnumcardlift = c 0
0.29/0.32 c # should presolving try to simplify inequalities
0.29/0.32 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.32 c constraints/linear/simplifyinequalities = c TRUE
0.29/0.32 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.32 c separating/maxroundsroot = c 5
0.29/0.32 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.32 c separating/maxrounds = c 1
0.29/0.32 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.32 c limits/solutions = c 1
0.29/0.32 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.32 c limits/memory = c 1620
0.29/0.32 c # maximal time in seconds to run
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.32 c limits/time = c 1791
0.29/0.32 c # frequency for displaying node information lines
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.32 c display/freq = c 10000
0.29/0.32 c -----------------------------------------------------------------------------------------------
0.29/0.32 c start solving problem
0.29/0.32 c
0.29/0.37 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.37 c 0.1s| 1 | 0 | 99 |7192k| 0 | 60 |1598 |1650 |1650 |1598 |3148 | 0 | 0 | 0 | 3.000000e+01 | -- | Inf
0.49/0.56 c 0.3s| 1 | 0 | 109 |7205k| 0 | 61 |1598 |1650 |1650 |1598 |3149 | 1 | 0 | 0 | 3.000000e+01 | -- | Inf
0.69/0.77 c 0.5s| 1 | 0 | 113 |7236k| 0 | 61 |1598 |1650 |1650 |1598 |3150 | 2 | 0 | 0 | 3.000000e+01 | -- | Inf
0.89/0.96 c 0.7s| 1 | 0 | 120 |7251k| 0 | 63 |1598 |1650 |1650 |1598 |3151 | 3 | 0 | 0 | 3.000000e+01 | -- | Inf
1.29/1.39 c 1.1s| 1 | 0 | 131 |7268k| 0 | 63 |1598 |1650 |1650 |1598 |3152 | 4 | 0 | 0 | 3.000000e+01 | -- | Inf
1.79/1.87 c 1.6s| 1 | 0 | 165 |7293k| 0 | 63 |1598 |1650 |1650 |1598 |3153 | 5 | 0 | 0 | 3.000000e+01 | -- | Inf
4.25/6.94 c 6.7s| 1 | 2 | 165 |7293k| 0 | 63 |1598 |1650 |1650 |1598 |3153 | 5 | 0 | 17 | 3.000000e+01 | -- | Inf
14.69/14.79 c
14.69/14.79 c SCIP Status : problem is solved [infeasible]
14.69/14.79 c Solving Time (sec) : 14.40
14.69/14.79 c Solving Nodes : 190
14.69/14.79 c Primal Bound : +1.00000000000000e+20 (0 solutions)
14.69/14.79 c Dual Bound : +1.00000000000000e+20
14.69/14.79 c Gap : 0.00 %
14.69/14.79 c NODE 190
14.69/14.79 c DUAL BOUND 1e+20
14.69/14.79 c PRIMAL BOUND 1e+20
14.69/14.79 c GAP 0
14.69/14.79 s UNSATISFIABLE
14.69/14.79 c SCIP Status : problem is solved [infeasible]
14.69/14.79 c Solving Time : 14.40
14.69/14.79 c Original Problem :
14.69/14.79 c Problem name : HOME/instance-1870762-1245218386.opb
14.69/14.79 c Variables : 1598 (1598 binary, 0 integer, 0 implicit integer, 0 continuous)
14.69/14.79 c Constraints : 1650 initial, 1650 maximal
14.69/14.79 c Presolved Problem :
14.69/14.79 c Problem name : t_HOME/instance-1870762-1245218386.opb
14.69/14.79 c Variables : 1598 (1598 binary, 0 integer, 0 implicit integer, 0 continuous)
14.69/14.79 c Constraints : 1650 initial, 1719 maximal
14.69/14.79 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
14.69/14.79 c trivial : 0.00 0 0 0 0 0 0 0 0
14.69/14.79 c dualfix : 0.00 0 0 0 0 0 0 0 0
14.69/14.79 c boundshift : 0.00 0 0 0 0 0 0 0 0
14.69/14.79 c inttobinary : 0.00 0 0 0 0 0 0 0 0
14.69/14.79 c implics : 0.00 0 0 0 0 0 0 0 0
14.69/14.79 c probing : 0.00 0 0 0 0 0 0 0 0
14.69/14.79 c knapsack : 0.00 0 0 0 0 0 0 0 0
14.69/14.79 c setppc : 0.00 0 0 0 0 0 0 0 0
14.69/14.79 c and : 0.10 0 0 0 0 0 0 0 0
14.69/14.79 c linear : 0.01 0 0 0 0 0 0 0 0
14.69/14.79 c logicor : 0.00 0 0 0 0 0 0 0 0
14.69/14.79 c root node : - 38 - - 38 - - - -
14.69/14.79 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
14.69/14.79 c integral : 0 0 0 143 0 3 65 0 0 200
14.69/14.79 c knapsack : 1 5 736 19 0 4 41 0 0 0
14.69/14.79 c setppc : 100 5 734 19 0 2 472 0 0 0
14.69/14.79 c and : 1498 185 732 19 0 0 12320 22846 0 0
14.69/14.79 c linear : 1 5 732 0 0 2 0 0 0 0
14.69/14.79 c logicor : 50+ 5 203 0 0 0 162 0 0 0
14.69/14.79 c countsols : 0 0 0 0 0 0 0 0 0 0
14.69/14.79 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
14.69/14.79 c integral : 9.35 0.00 0.00 9.35 0.00
14.69/14.79 c knapsack : 0.00 0.00 0.00 0.00 0.00
14.69/14.79 c setppc : 0.00 0.00 0.00 0.00 0.00
14.69/14.79 c and : 0.25 0.16 0.06 0.03 0.00
14.69/14.79 c linear : 0.00 0.00 0.00 0.00 0.00
14.69/14.79 c logicor : 0.00 0.00 0.00 0.00 0.00
14.69/14.79 c countsols : 0.00 0.00 0.00 0.00 0.00
14.69/14.79 c Propagators : Time Calls Cutoffs DomReds
14.69/14.79 c rootredcost : 0.00 0 0 0
14.69/14.79 c pseudoobj : 0.04 739 0 0
14.69/14.79 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
14.69/14.79 c propagation : 0.00 8 8 22 17.4 0 0.0 -
14.69/14.79 c infeasible LP : 0.08 67 67 235 15.9 0 0.0 0
14.69/14.79 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
14.69/14.79 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
14.69/14.79 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
14.69/14.79 c applied globally : - - - 107 12.6 - - -
14.69/14.79 c applied locally : - - - 0 0.0 - - -
14.69/14.79 c Separators : Time Calls Cutoffs DomReds Cuts Conss
14.69/14.79 c cut pool : 0.00 4 - - 1 - (maximal pool size: 20)
14.69/14.79 c redcost : 0.02 185 0 0 0 0
14.69/14.79 c impliedbounds : 0.01 5 0 0 0 0
14.69/14.79 c intobj : 0.00 0 0 0 0 0
14.69/14.79 c gomory : 0.87 5 0 0 1500 0
14.69/14.79 c strongcg : 0.51 5 0 0 2500 0
14.69/14.80 c cmir : 0.00 0 0 0 0 0
14.69/14.80 c flowcover : 0.00 0 0 0 0 0
14.69/14.80 c clique : 0.00 5 0 0 0 0
14.69/14.80 c zerohalf : 0.00 0 0 0 0 0
14.69/14.80 c mcf : 0.02 2 0 0 0 0
14.69/14.80 c Pricers : Time Calls Vars
14.69/14.80 c problem variables: 0.00 0 0
14.69/14.80 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
14.69/14.80 c relpscost : 9.35 124 3 65 0 0 200
14.69/14.80 c pscost : 0.00 0 0 0 0 0 0
14.69/14.80 c inference : 0.00 0 0 0 0 0 0
14.69/14.80 c mostinf : 0.00 0 0 0 0 0 0
14.69/14.80 c leastinf : 0.00 0 0 0 0 0 0
14.69/14.80 c fullstrong : 0.00 0 0 0 0 0 0
14.69/14.80 c allfullstrong : 0.00 0 0 0 0 0 0
14.69/14.80 c random : 0.00 0 0 0 0 0 0
14.69/14.80 c Primal Heuristics : Time Calls Found
14.69/14.80 c LP solutions : 0.00 - 0
14.69/14.80 c pseudo solutions : 0.00 - 0
14.69/14.80 c simplerounding : 0.00 0 0
14.69/14.80 c rounding : 0.00 0 0
14.69/14.80 c shifting : 0.00 0 0
14.69/14.80 c intshifting : 0.00 0 0
14.69/14.80 c oneopt : 0.00 0 0
14.69/14.80 c fixandinfer : 0.00 0 0
14.69/14.80 c feaspump : 0.00 0 0
14.69/14.80 c coefdiving : 0.00 0 0
14.69/14.80 c pscostdiving : 0.00 0 0
14.69/14.80 c fracdiving : 0.00 0 0
14.69/14.80 c veclendiving : 0.00 0 0
14.69/14.80 c intdiving : 0.00 0 0
14.69/14.80 c actconsdiving : 0.00 0 0
14.69/14.80 c objpscostdiving : 0.00 0 0
14.69/14.80 c rootsoldiving : 0.00 0 0
14.69/14.80 c linesearchdiving : 0.00 0 0
14.69/14.80 c guideddiving : 0.00 0 0
14.69/14.80 c octane : 0.00 0 0
14.69/14.80 c rens : 0.00 0 0
14.69/14.80 c rins : 0.00 0 0
14.69/14.80 c localbranching : 0.00 0 0
14.69/14.80 c mutation : 0.00 0 0
14.69/14.80 c crossover : 0.00 0 0
14.69/14.80 c dins : 0.00 0 0
14.69/14.80 c LP : Time Calls Iterations Iter/call Iter/sec
14.69/14.80 c primal LP : 0.01 0 0 0.00 0.00
14.69/14.80 c dual LP : 2.64 397 16826 42.38 6373.48
14.69/14.80 c barrier LP : 0.00 0 0 0.00 -
14.69/14.80 c diving/probing LP: 0.00 0 0 0.00 -
14.69/14.80 c strong branching : 9.34 1036 32883 31.74 3520.66
14.69/14.80 c (at root node) : - 17 8673 510.18 -
14.69/14.80 c conflict analysis: 0.00 0 0 0.00 -
14.69/14.80 c B&B Tree :
14.69/14.80 c number of runs : 1
14.69/14.80 c nodes : 190
14.69/14.80 c nodes (total) : 190
14.69/14.80 c nodes left : 0
14.69/14.80 c max depth : 41
14.69/14.80 c max depth (total): 41
14.69/14.80 c backtracks : 43 (22.6%)
14.69/14.80 c delayed cutoffs : 11
14.69/14.80 c repropagations : 184 (2796 domain reductions, 0 cutoffs)
14.69/14.80 c avg switch length: 3.62
14.69/14.80 c switching time : 0.07
14.69/14.80 c Solution :
14.69/14.80 c Solutions found : 0 (0 improvements)
14.69/14.80 c Primal Bound : infeasible
14.69/14.80 c Dual Bound : -
14.69/14.80 c Gap : 0.00 %
14.69/14.80 c Root Dual Bound : +3.00000000000000e+01
14.79/14.82 c Time complete: 14.81.