0.00/0.04 c SCIP version 1.1.0.7
0.00/0.04 c LP-Solver Clp 1.8.2
0.00/0.04 c user parameter file <scip.set> not found - using default parameters
0.00/0.04 c read problem <HOME/instance-1870591-1245213059.opb>
0.00/0.04 c original problem has 3238 variables (3238 bin, 0 int, 0 impl, 0 cont) and 3340 constraints
0.06/0.07 c No objective function, only one solution is needed.
0.06/0.07 c start presolving problem
0.06/0.07 c presolving:
0.19/0.24 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 301 upgd conss, 24504 impls, 200 clqs
0.29/0.38 c presolving (2 rounds):
0.29/0.38 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.38 c 24504 implications, 200 cliques
0.29/0.38 c presolved problem has 3238 variables (3238 bin, 0 int, 0 impl, 0 cont) and 3340 constraints
0.29/0.38 c 1 constraints of type <knapsack>
0.29/0.38 c 200 constraints of type <setppc>
0.29/0.38 c 3038 constraints of type <and>
0.29/0.38 c 1 constraints of type <linear>
0.29/0.38 c 100 constraints of type <logicor>
0.29/0.38 c transformed objective value is always integral (scale: 1)
0.29/0.38 c Presolving Time: 0.16
0.29/0.38 c SATUNSAT-NLC
0.29/0.38 c -----------------------------------------------------------------------------------------------
0.29/0.38 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.38 c separating/flowcover/freq = c -1
0.29/0.38 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.38 c separating/cmir/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/veclendiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.29/0.38 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/veclendiving/freq = c -1
0.29/0.38 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.38 c heuristics/simplerounding/freq = c -1
0.29/0.38 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/shifting/freq = c -1
0.29/0.38 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.38 c heuristics/rounding/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.38 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.29/0.38 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.38 c heuristics/rootsoldiving/freq = c -1
0.29/0.38 c # number of nodes added to the contingent of the total nodes
0.29/0.38 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.38 c heuristics/rens/nodesofs = c 2000
0.29/0.38 c # minimum percentage of integer variables that have to be fixable
0.29/0.38 c # [type: real, range: [0,1], default: 0.5]
0.29/0.38 c heuristics/rens/minfixingrate = c 0.3
0.29/0.38 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.38 c heuristics/rens/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.29/0.38 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/pscostdiving/freq = c -1
0.29/0.38 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.38 c heuristics/oneopt/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.38 c # [type: real, range: [0,1], default: 0.01]
0.29/0.38 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.29/0.38 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.38 c heuristics/objpscostdiving/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.29/0.38 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/linesearchdiving/freq = c -1
0.29/0.38 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/intshifting/freq = c -1
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/intdiving/maxlpiterquot = c 0.075
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/guideddiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.29/0.38 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/guideddiving/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/fracdiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.29/0.38 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/fracdiving/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/feaspump/maxlpiterofs = c 2000
0.29/0.38 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.38 c heuristics/feaspump/freq = c -1
0.29/0.38 c # minimum percentage of integer variables that have to be fixed
0.29/0.38 c # [type: real, range: [0,1], default: 0.666]
0.29/0.38 c heuristics/crossover/minfixingrate = c 0.5
0.29/0.38 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.38 c # [type: real, range: [0,1], default: 0.1]
0.29/0.38 c heuristics/crossover/nodesquot = c 0.15
0.29/0.38 c # number of nodes without incumbent change that heuristic should wait
0.29/0.38 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.38 c heuristics/crossover/nwaitingnodes = c 100
0.29/0.38 c # number of nodes added to the contingent of the total nodes
0.29/0.38 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.38 c heuristics/crossover/nodesofs = c 750
0.29/0.38 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.38 c heuristics/crossover/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/coefdiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.29/0.38 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/coefdiving/freq = c -1
0.29/0.38 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.38 c presolving/probing/maxrounds = c 0
0.29/0.38 c # should presolving try to simplify knapsacks
0.29/0.38 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.38 c constraints/knapsack/simplifyinequalities = c TRUE
0.29/0.38 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.38 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.38 c constraints/knapsack/disaggregation = c FALSE
0.29/0.38 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.38 c constraints/knapsack/maxnumcardlift = c 0
0.29/0.38 c # should presolving try to simplify inequalities
0.29/0.39 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.39 c constraints/linear/simplifyinequalities = c TRUE
0.29/0.39 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c separating/maxroundsroot = c 5
0.29/0.39 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.39 c separating/maxrounds = c 1
0.29/0.39 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c limits/solutions = c 1
0.29/0.39 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.39 c limits/memory = c 1620
0.29/0.39 c # maximal time in seconds to run
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.39 c limits/time = c 1791
0.29/0.39 c # frequency for displaying node information lines
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.39 c display/freq = c 10000
0.29/0.39 c -----------------------------------------------------------------------------------------------
0.29/0.39 c start solving problem
0.29/0.39 c
0.49/0.53 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.53 c 0.3s| 1 | 0 | 174 | 14M| 0 | 160 |3238 |3340 |3340 |3238 |6378 | 0 | 0 | 0 | 8.000000e+01 | -- | Inf
1.10/1.16 c 0.9s| 1 | 0 | 355 | 14M| 0 | 162 |3238 |3340 |3340 |3238 |6380 | 2 | 0 | 0 | 8.000000e+01 | -- | Inf
2.69/2.73 c 2.5s| 1 | 0 | 387 | 14M| 0 | 164 |3238 |3340 |3340 |3238 |6381 | 3 | 0 | 0 | 8.000000e+01 | -- | Inf
4.39/4.46 c 4.2s| 1 | 0 | 470 | 14M| 0 | 164 |3238 |3340 |3340 |3238 |6382 | 4 | 0 | 0 | 8.000000e+01 | -- | Inf
6.29/6.36 c 6.1s| 1 | 0 | 563 | 14M| 0 | 163 |3238 |3340 |3340 |3238 |6383 | 5 | 0 | 0 | 8.000000e+01 | -- | Inf
7.98/8.04 c 7.8s| 1 | 0 | 612 | 14M| 0 | 164 |3238 |3340 |3340 |3238 |6384 | 6 | 0 | 0 | 8.000000e+01 | -- | Inf
20.89/20.98 c 20.7s| 1 | 2 | 612 | 14M| 0 | 164 |3238 |3340 |3340 |3238 |6384 | 6 | 0 | 33 | 8.000000e+01 | -- | Inf
305.10/305.20 c
305.10/305.20 c SCIP Status : problem is solved [infeasible]
305.10/305.20 c Solving Time (sec) : 304.16
305.10/305.20 c Solving Nodes : 1471
305.10/305.20 c Primal Bound : +1.00000000000000e+20 (0 solutions)
305.10/305.20 c Dual Bound : +1.00000000000000e+20
305.10/305.20 c Gap : 0.00 %
305.10/305.20 c NODE 1471
305.10/305.20 c DUAL BOUND 1e+20
305.10/305.20 c PRIMAL BOUND 1e+20
305.10/305.20 c GAP 0
305.10/305.20 s UNSATISFIABLE
305.10/305.20 c SCIP Status : problem is solved [infeasible]
305.10/305.20 c Solving Time : 304.16
305.10/305.20 c Original Problem :
305.10/305.20 c Problem name : HOME/instance-1870591-1245213059.opb
305.10/305.20 c Variables : 3238 (3238 binary, 0 integer, 0 implicit integer, 0 continuous)
305.10/305.20 c Constraints : 3340 initial, 3340 maximal
305.10/305.20 c Presolved Problem :
305.10/305.20 c Problem name : t_HOME/instance-1870591-1245213059.opb
305.10/305.20 c Variables : 3238 (3238 binary, 0 integer, 0 implicit integer, 0 continuous)
305.10/305.20 c Constraints : 3340 initial, 3340 maximal
305.10/305.20 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
305.10/305.20 c trivial : 0.00 0 0 0 0 0 0 0 0
305.10/305.20 c dualfix : 0.00 0 0 0 0 0 0 0 0
305.10/305.20 c boundshift : 0.00 0 0 0 0 0 0 0 0
305.10/305.20 c inttobinary : 0.00 0 0 0 0 0 0 0 0
305.10/305.20 c implics : 0.00 0 0 0 0 0 0 0 0
305.10/305.20 c probing : 0.00 0 0 0 0 0 0 0 0
305.10/305.20 c knapsack : 0.00 0 0 0 0 0 0 0 0
305.10/305.20 c setppc : 0.01 0 0 0 0 0 0 0 0
305.10/305.20 c and : 0.12 0 0 0 0 0 0 0 0
305.10/305.20 c linear : 0.02 0 0 0 0 0 0 0 0
305.10/305.20 c logicor : 0.00 0 0 0 0 0 0 0 0
305.10/305.20 c root node : - 133 - - 133 - - - -
305.10/305.20 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
305.10/305.20 c integral : 0 0 0 747 0 2 16 0 0 1470
305.10/305.20 c knapsack : 1 5 3714 4 0 0 0 0 0 0
305.10/305.20 c setppc : 200 5 3714 4 0 3 27217 0 0 0
305.10/305.20 c and : 3038 985 3711 4 0 20 667457 362893 0 0
305.10/305.20 c linear : 1 5 3691 0 0 0 0 0 0 0
305.10/305.20 c logicor : 100+ 5 1242 0 0 0 1150 0 0 0
305.10/305.20 c countsols : 0 0 0 0 0 0 0 0 0 0
305.10/305.20 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
305.10/305.20 c integral : 101.80 0.00 0.00 101.80 0.00
305.10/305.20 c knapsack : 0.00 0.00 0.00 0.00 0.00
305.10/305.20 c setppc : 0.08 0.00 0.08 0.00 0.00
305.10/305.20 c and : 6.22 3.06 3.15 0.01 0.00
305.10/305.20 c linear : 0.06 0.00 0.06 0.00 0.00
305.10/305.20 c logicor : 0.03 0.00 0.03 0.00 0.00
305.10/305.20 c countsols : 0.00 0.00 0.00 0.00 0.00
305.10/305.20 c Propagators : Time Calls Cutoffs DomReds
305.10/305.20 c rootredcost : 0.01 0 0 0
305.10/305.20 c pseudoobj : 1.42 3765 1 0
305.10/305.20 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
305.10/305.20 c propagation : 0.00 23 23 23 2.1 0 0.0 -
305.10/305.20 c infeasible LP : 0.49 710 0 0 0.0 0 0.0 0
305.10/305.20 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
305.10/305.20 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
305.10/305.20 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
305.10/305.20 c applied globally : - - - 23 2.1 - - -
305.10/305.20 c applied locally : - - - 0 0.0 - - -
305.10/305.20 c Separators : Time Calls Cutoffs DomReds Cuts Conss
305.10/305.20 c cut pool : 0.00 4 - - 4 - (maximal pool size: 34)
305.10/305.20 c redcost : 0.32 985 0 0 0 0
305.10/305.20 c impliedbounds : 0.01 5 0 0 0 0
305.10/305.20 c intobj : 0.00 0 0 0 0 0
305.10/305.20 c gomory : 3.81 5 0 0 500 0
305.10/305.20 c strongcg : 3.05 5 0 0 1509 0
305.10/305.20 c cmir : 0.00 0 0 0 0 0
305.10/305.20 c flowcover : 0.00 0 0 0 0 0
305.10/305.20 c clique : 0.01 5 0 0 0 0
305.10/305.20 c zerohalf : 0.00 0 0 0 0 0
305.10/305.20 c mcf : 0.05 2 0 0 0 0
305.10/305.20 c Pricers : Time Calls Vars
305.10/305.20 c problem variables: 0.00 0 0
305.10/305.20 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
305.10/305.20 c relpscost : 101.80 743 2 16 0 0 1470
305.10/305.20 c pscost : 0.00 0 0 0 0 0 0
305.10/305.20 c inference : 0.00 0 0 0 0 0 0
305.10/305.20 c mostinf : 0.00 0 0 0 0 0 0
305.10/305.20 c leastinf : 0.00 0 0 0 0 0 0
305.10/305.20 c fullstrong : 0.00 0 0 0 0 0 0
305.10/305.20 c allfullstrong : 0.00 0 0 0 0 0 0
305.10/305.20 c random : 0.00 0 0 0 0 0 0
305.10/305.20 c Primal Heuristics : Time Calls Found
305.10/305.20 c LP solutions : 0.00 - 0
305.10/305.20 c pseudo solutions : 0.00 - 0
305.10/305.20 c simplerounding : 0.00 0 0
305.10/305.20 c rounding : 0.00 0 0
305.10/305.20 c shifting : 0.00 0 0
305.10/305.20 c intshifting : 0.00 0 0
305.10/305.20 c oneopt : 0.00 0 0
305.10/305.20 c fixandinfer : 0.00 0 0
305.10/305.20 c feaspump : 0.00 0 0
305.10/305.20 c coefdiving : 0.00 0 0
305.10/305.20 c pscostdiving : 0.00 0 0
305.10/305.20 c fracdiving : 0.00 0 0
305.10/305.20 c veclendiving : 0.00 0 0
305.10/305.20 c intdiving : 0.00 0 0
305.10/305.20 c actconsdiving : 0.00 0 0
305.10/305.20 c objpscostdiving : 0.00 0 0
305.10/305.20 c rootsoldiving : 0.00 0 0
305.10/305.20 c linesearchdiving : 0.00 0 0
305.10/305.20 c guideddiving : 0.00 0 0
305.10/305.20 c octane : 0.00 0 0
305.10/305.20 c rens : 0.00 0 0
305.10/305.20 c rins : 0.00 0 0
305.10/305.20 c localbranching : 0.00 0 0
305.10/305.20 c mutation : 0.00 0 0
305.10/305.20 c crossover : 0.00 0 0
305.10/305.20 c dins : 0.00 0 0
305.10/305.20 c LP : Time Calls Iterations Iter/call Iter/sec
305.10/305.20 c primal LP : 28.02 0 0 0.00 0.00
305.10/305.20 c dual LP : 149.22 2424 425498 175.54 2851.48
305.10/305.20 c barrier LP : 0.00 0 0 0.00 -
305.10/305.20 c diving/probing LP: 0.00 0 0 0.00 -
305.10/305.20 c strong branching : 101.63 4280 322200 75.28 3170.32
305.10/305.20 c (at root node) : - 33 10517 318.70 -
305.10/305.20 c conflict analysis: 0.00 0 0 0.00 -
305.10/305.20 c B&B Tree :
305.10/305.20 c number of runs : 1
305.10/305.20 c nodes : 1471
305.10/305.20 c nodes (total) : 1471
305.10/305.20 c nodes left : 0
305.10/305.20 c max depth : 60
305.10/305.20 c max depth (total): 60
305.10/305.20 c backtracks : 302 (20.5%)
305.10/305.20 c delayed cutoffs : 0
305.10/305.20 c repropagations : 39 (168 domain reductions, 0 cutoffs)
305.10/305.20 c avg switch length: 6.18
305.10/305.20 c switching time : 30.07
305.10/305.20 c Solution :
305.10/305.20 c Solutions found : 0 (0 improvements)
305.10/305.20 c Primal Bound : infeasible
305.10/305.20 c Dual Bound : -
305.10/305.20 c Gap : 0.00 %
305.10/305.20 c Root Dual Bound : +8.00000000000002e+01
305.10/305.25 c Time complete: 305.16.