0.00/0.05 c SCIP version 1.1.0.7
0.00/0.05 c LP-Solver Clp 1.8.2
0.00/0.05 c user parameter file <scip.set> not found - using default parameters
0.00/0.05 c read problem <HOME/instance-1868303-1245120275.opb>
0.00/0.05 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.00/0.06 c No objective function, only one solution is needed.
0.00/0.06 c start presolving problem
0.00/0.06 c presolving:
0.09/0.10 c (round 1) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.09/0.11 c (round 2) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.09/0.12 c presolving (3 rounds):
0.09/0.12 c 0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.12 c 242 implications, 22 cliques
0.09/0.12 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2564 constraints
0.09/0.12 c 1 constraints of type <knapsack>
0.09/0.12 c 22 constraints of type <setppc>
0.09/0.12 c 2541 constraints of type <logicor>
0.09/0.12 c transformed objective value is always integral (scale: 1)
0.09/0.12 c Presolving Time: 0.06
0.09/0.12 c SATUNSAT-LIN
0.09/0.12 c -----------------------------------------------------------------------------------------------
0.09/0.12 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c separating/flowcover/freq = c -1
0.09/0.12 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c separating/cmir/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/veclendiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/veclendiving/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c heuristics/simplerounding/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/shifting/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c heuristics/rounding/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.12 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.09/0.12 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12 c heuristics/rootsoldiving/freq = c -1
0.09/0.12 c # number of nodes added to the contingent of the total nodes
0.09/0.12 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.12 c heuristics/rens/nodesofs = c 2000
0.09/0.12 c # minimum percentage of integer variables that have to be fixable
0.09/0.12 c # [type: real, range: [0,1], default: 0.5]
0.09/0.12 c heuristics/rens/minfixingrate = c 0.3
0.09/0.12 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c heuristics/rens/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/pscostdiving/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c heuristics/oneopt/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.12 c # [type: real, range: [0,1], default: 0.01]
0.09/0.12 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.09/0.12 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12 c heuristics/objpscostdiving/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/linesearchdiving/freq = c -1
0.09/0.12 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/intshifting/freq = c -1
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/intdiving/maxlpiterquot = c 0.075
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/guideddiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/guideddiving/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/fracdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/fracdiving/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/feaspump/maxlpiterofs = c 2000
0.09/0.12 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.12 c heuristics/feaspump/freq = c -1
0.09/0.12 c # minimum percentage of integer variables that have to be fixed
0.09/0.12 c # [type: real, range: [0,1], default: 0.666]
0.09/0.12 c heuristics/crossover/minfixingrate = c 0.5
0.09/0.12 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.12 c # [type: real, range: [0,1], default: 0.1]
0.09/0.12 c heuristics/crossover/nodesquot = c 0.15
0.09/0.12 c # number of nodes without incumbent change that heuristic should wait
0.09/0.12 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.12 c heuristics/crossover/nwaitingnodes = c 100
0.09/0.12 c # number of nodes added to the contingent of the total nodes
0.09/0.12 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.12 c heuristics/crossover/nodesofs = c 750
0.09/0.12 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.12 c heuristics/crossover/freq = c -1
0.09/0.12 c # additional number of allowed LP iterations
0.09/0.12 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.12 c heuristics/coefdiving/maxlpiterofs = c 1500
0.09/0.12 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.12 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.09/0.12 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.12 c heuristics/coefdiving/freq = c -1
0.09/0.12 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c presolving/probing/maxrounds = c 0
0.09/0.12 c # should presolving try to simplify knapsacks
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/knapsack/simplifyinequalities = c TRUE
0.09/0.12 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.12 c constraints/knapsack/disaggregation = c FALSE
0.09/0.12 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c constraints/knapsack/maxnumcardlift = c 0
0.09/0.12 c # should presolving try to simplify inequalities
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/linear/simplifyinequalities = c TRUE
0.09/0.12 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c separating/maxroundsroot = c 5
0.09/0.12 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.12 c separating/maxrounds = c 1
0.09/0.12 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c limits/solutions = c 1
0.09/0.12 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/memory = c 1620
0.09/0.12 c # maximal time in seconds to run
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/time = c 1791
0.09/0.12 c # frequency for displaying node information lines
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.12 c display/freq = c 10000
0.09/0.12 c -----------------------------------------------------------------------------------------------
0.09/0.12 c start solving problem
0.09/0.12 c
0.09/0.14 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.14 c 0.1s| 1 | 0 | 57 |3513k| 0 | 34 | 231 |2564 |2564 | 231 |2564 | 0 | 0 | 0 | 1.100000e+01 | -- | Inf
0.19/0.28 c 0.2s| 1 | 0 | 112 |3732k| 0 | 48 | 231 |2564 |2564 | 231 |2572 | 8 | 0 | 0 | 1.100000e+01 | -- | Inf
0.39/0.46 c 0.4s| 1 | 0 | 221 |4024k| 0 | 52 | 231 |2564 |2564 | 231 |2577 | 13 | 0 | 0 | 1.100000e+01 | -- | Inf
0.59/0.61 c 0.5s| 1 | 0 | 427 |4107k| 0 | 40 | 231 |2564 |2564 | 231 |2582 | 18 | 0 | 0 | 1.100000e+01 | -- | Inf
0.79/0.89 c 0.8s| 1 | 0 | 623 |4502k| 0 | 45 | 231 |2564 |2564 | 231 |2585 | 21 | 0 | 0 | 1.100000e+01 | -- | Inf
1.00/1.06 c 1.0s| 1 | 0 | 805 |4677k| 0 | 41 | 231 |2564 |2564 | 231 |2592 | 28 | 0 | 0 | 1.100000e+01 | -- | Inf
1.79/1.83 c 1.8s| 1 | 2 | 805 |4678k| 0 | 41 | 231 |2564 |2564 | 231 |2592 | 28 | 0 | 23 | 1.100000e+01 | -- | Inf
141.03/141.18 c 140s| 10000 | 213 |384898 |5636k| 48 | 27 | 231 |2880 |1574 | 231 |2573 | 28 | 948 |2531 | 1.500000e+01 | -- | Inf
184.62/184.70 c
184.62/184.70 c SCIP Status : problem is solved [infeasible]
184.62/184.70 c Solving Time (sec) : 183.35
184.62/184.70 c Solving Nodes : 14671
184.62/184.70 c Primal Bound : +1.00000000000000e+20 (0 solutions)
184.62/184.70 c Dual Bound : +1.00000000000000e+20
184.62/184.70 c Gap : 0.00 %
184.62/184.70 c NODE 14671
184.62/184.70 c DUAL BOUND 1e+20
184.62/184.70 c PRIMAL BOUND 1e+20
184.62/184.70 c GAP 0
184.62/184.70 s UNSATISFIABLE
184.62/184.70 c SCIP Status : problem is solved [infeasible]
184.62/184.70 c Solving Time : 183.35
184.62/184.70 c Original Problem :
184.62/184.70 c Problem name : HOME/instance-1868303-1245120275.opb
184.62/184.70 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
184.62/184.70 c Constraints : 2707 initial, 2707 maximal
184.62/184.70 c Presolved Problem :
184.62/184.70 c Problem name : t_HOME/instance-1868303-1245120275.opb
184.62/184.70 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
184.62/184.70 c Constraints : 2564 initial, 2884 maximal
184.62/184.70 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
184.62/184.70 c trivial : 0.00 0 0 0 0 0 0 0 0
184.62/184.70 c dualfix : 0.00 0 0 0 0 0 0 0 0
184.62/184.70 c boundshift : 0.00 0 0 0 0 0 0 0 0
184.62/184.70 c inttobinary : 0.00 0 0 0 0 0 0 0 0
184.62/184.70 c implics : 0.00 0 0 0 0 0 0 0 0
184.62/184.70 c probing : 0.00 0 0 0 0 0 0 0 0
184.62/184.70 c knapsack : 0.00 0 0 0 0 0 0 0 0
184.62/184.70 c setppc : 0.00 0 0 0 0 0 0 0 0
184.62/184.70 c linear : 0.03 0 0 0 0 0 143 0 0
184.62/184.70 c logicor : 0.03 0 0 0 0 0 0 0 0
184.62/184.70 c root node : - 1 - - 1 - - - -
184.62/184.70 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
184.62/184.70 c integral : 0 0 0 7956 0 107 984 0 0 14702
184.62/184.70 c knapsack : 1 5 30824 0 0 95 41995 0 0 0
184.62/184.70 c setppc : 22 5 30788 0 0 446 82925 0 0 0
184.62/184.70 c logicor : 2541+ 5 26550 0 0 88 80584 0 0 0
184.62/184.70 c countsols : 0 0 0 0 0 0 0 0 0 0
184.62/184.70 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
184.62/184.70 c integral : 40.95 0.00 0.00 40.95 0.00
184.62/184.70 c knapsack : 0.12 0.00 0.12 0.00 0.00
184.62/184.70 c setppc : 0.39 0.00 0.39 0.00 0.00
184.62/184.70 c logicor : 1.74 0.01 1.73 0.00 0.00
184.62/184.70 c countsols : 0.00 0.00 0.00 0.00 0.00
184.62/184.70 c Propagators : Time Calls Cutoffs DomReds
184.62/184.70 c rootredcost : 0.03 0 0 0
184.62/184.70 c pseudoobj : 0.40 30891 1 0
184.62/184.70 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
184.62/184.70 c propagation : 0.04 629 629 2409 13.0 5 11.8 -
184.62/184.70 c infeasible LP : 0.35 6615 0 0 0.0 0 0.0 0
184.62/184.70 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
184.62/184.70 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
184.62/184.70 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
184.62/184.70 c applied globally : - - - 1255 12.1 - - -
184.62/184.70 c applied locally : - - - 0 0.0 - - -
184.62/184.70 c Separators : Time Calls Cutoffs DomReds Cuts Conss
184.62/184.70 c cut pool : 0.00 4 - - 4 - (maximal pool size: 479)
184.62/184.70 c redcost : 0.06 7497 0 0 0 0
184.62/184.70 c impliedbounds : 0.00 5 0 0 0 0
184.62/184.70 c intobj : 0.00 0 0 0 0 0
184.62/184.70 c gomory : 0.33 5 0 0 2500 0
184.62/184.70 c strongcg : 0.30 5 0 0 2500 0
184.62/184.70 c cmir : 0.00 0 0 0 0 0
184.62/184.70 c flowcover : 0.00 0 0 0 0 0
184.62/184.70 c clique : 0.00 5 0 0 0 0
184.62/184.70 c zerohalf : 0.00 0 0 0 0 0
184.62/184.70 c mcf : 0.00 1 0 0 0 0
184.62/184.70 c Pricers : Time Calls Vars
184.62/184.70 c problem variables: 0.00 0 0
184.62/184.70 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
184.62/184.70 c relpscost : 40.95 7956 107 984 0 0 14702
184.62/184.70 c pscost : 0.00 0 0 0 0 0 0
184.62/184.70 c inference : 0.00 0 0 0 0 0 0
184.62/184.70 c mostinf : 0.00 0 0 0 0 0 0
184.62/184.70 c leastinf : 0.00 0 0 0 0 0 0
184.62/184.70 c fullstrong : 0.00 0 0 0 0 0 0
184.62/184.70 c allfullstrong : 0.00 0 0 0 0 0 0
184.62/184.70 c random : 0.00 0 0 0 0 0 0
184.62/184.70 c Primal Heuristics : Time Calls Found
184.62/184.70 c LP solutions : 0.00 - 0
184.62/184.70 c pseudo solutions : 0.00 - 0
184.62/184.70 c simplerounding : 0.00 0 0
184.62/184.70 c rounding : 0.00 0 0
184.62/184.70 c shifting : 0.00 0 0
184.62/184.70 c intshifting : 0.00 0 0
184.62/184.70 c oneopt : 0.00 0 0
184.62/184.70 c fixandinfer : 0.00 0 0
184.62/184.70 c feaspump : 0.00 0 0
184.62/184.70 c coefdiving : 0.00 0 0
184.62/184.70 c pscostdiving : 0.00 0 0
184.62/184.70 c fracdiving : 0.00 0 0
184.62/184.70 c veclendiving : 0.00 0 0
184.62/184.70 c intdiving : 0.00 0 0
184.62/184.70 c actconsdiving : 0.00 0 0
184.62/184.70 c objpscostdiving : 0.00 0 0
184.62/184.70 c rootsoldiving : 0.00 0 0
184.62/184.70 c linesearchdiving : 0.00 0 0
184.62/184.70 c guideddiving : 0.00 0 0
184.62/184.70 c octane : 0.00 0 0
184.62/184.70 c rens : 0.00 0 0
184.62/184.70 c rins : 0.00 0 0
184.62/184.70 c localbranching : 0.00 0 0
184.62/184.70 c mutation : 0.00 0 0
184.62/184.70 c crossover : 0.00 0 0
184.62/184.70 c dins : 0.00 0 0
184.62/184.70 c LP : Time Calls Iterations Iter/call Iter/sec
184.62/184.70 c primal LP : 0.01 0 0 0.00 0.00
184.62/184.70 c dual LP : 131.43 14556 521506 35.83 3967.94
184.62/184.70 c barrier LP : 0.00 0 0 0.00 -
184.62/184.70 c diving/probing LP: 0.00 0 0 0.00 -
184.62/184.70 c strong branching : 40.56 2760 172066 62.34 4242.26
184.62/184.70 c (at root node) : - 23 3024 131.48 -
184.62/184.70 c conflict analysis: 0.00 0 0 0.00 -
184.62/184.70 c B&B Tree :
184.62/184.70 c number of runs : 1
184.62/184.70 c nodes : 14671
184.62/184.70 c nodes (total) : 14671
184.62/184.70 c nodes left : 0
184.62/184.70 c max depth : 48
184.62/184.70 c max depth (total): 48
184.62/184.70 c backtracks : 1374 (9.4%)
184.62/184.70 c delayed cutoffs : 32
184.62/184.70 c repropagations : 1500 (3957 domain reductions, 32 cutoffs)
184.62/184.70 c avg switch length: 3.78
184.62/184.70 c switching time : 2.02
184.62/184.70 c Solution :
184.62/184.70 c Solutions found : 0 (0 improvements)
184.62/184.70 c Primal Bound : infeasible
184.62/184.70 c Dual Bound : -
184.62/184.70 c Gap : 0.00 %
184.62/184.70 c Root Dual Bound : +1.10000000000000e+01
184.62/184.72 c Time complete: 184.63.