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-1868373-1245122906.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.05
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 | 61 |3513k| 0 | 37 | 231 |2564 |2564 | 231 |2564 | 0 | 0 | 0 | 1.100000e+01 | -- | Inf
0.19/0.27 c 0.2s| 1 | 0 | 87 |3763k| 0 | 39 | 231 |2564 |2564 | 231 |2572 | 8 | 0 | 0 | 1.100000e+01 | -- | Inf
0.49/0.56 c 0.5s| 1 | 0 | 169 |4225k| 0 | 41 | 231 |2564 |2564 | 231 |2574 | 10 | 0 | 0 | 1.100000e+01 | -- | Inf
0.69/0.72 c 0.6s| 1 | 0 | 247 |4389k| 0 | 31 | 231 |2564 |2564 | 231 |2579 | 15 | 0 | 0 | 1.100000e+01 | -- | Inf
0.79/0.89 c 0.8s| 1 | 0 | 378 |4535k| 0 | 28 | 231 |2564 |2564 | 231 |2582 | 18 | 0 | 0 | 1.100000e+01 | -- | Inf
0.89/0.99 c 0.9s| 1 | 0 | 409 |4557k| 0 | 40 | 231 |2564 |2564 | 231 |2585 | 21 | 0 | 0 | 1.100000e+01 | -- | Inf
1.89/1.99 c 1.9s| 1 | 2 | 409 |4558k| 0 | 40 | 231 |2564 |2564 | 231 |2585 | 21 | 0 | 22 | 1.100000e+01 | -- | Inf
132.05/132.15 c 131s| 10000 | 777 |359589 |6833k| 61 | 34 | 231 |3200 |1370 | 231 |2569 | 21 |1195 |2635 | 1.400000e+01 | -- | Inf
218.22/218.35 c 217s| 20000 | 888 |642226 |7322k| 61 | - | 231 |3086 |1537 | 231 |2569 | 21 |2431 |2849 | 1.500000e+01 | -- | Inf
310.89/311.00 c 309s| 30000 | 1021 |923165 |7924k| 61 | - | 231 |3158 | 428 | 0 | 0 | 21 |3693 |3600 | 1.500000e+01 | -- | Inf
393.47/393.67 c 391s| 40000 | 694 | 1166k|7424k| 61 | - | 231 |3654 |1021 | 231 |2569 | 21 |6121 |4173 | 1.600000e+01 | -- | Inf
466.35/466.52 c 464s| 50000 | 94 | 1358k|5576k| 61 | - | 231 |3307 |1154 | 231 |2569 | 21 |7906 |4548 | 1.800000e+01 | -- | Inf
469.75/469.98 c
469.75/469.98 c SCIP Status : problem is solved [infeasible]
469.75/469.98 c Solving Time (sec) : 467.01
469.75/469.98 c Solving Nodes : 50534
469.75/469.98 c Primal Bound : +1.00000000000000e+20 (0 solutions)
469.75/469.98 c Dual Bound : +1.00000000000000e+20
469.75/469.98 c Gap : 0.00 %
469.75/469.98 c NODE 50534
469.75/469.98 c DUAL BOUND 1e+20
469.75/469.98 c PRIMAL BOUND 1e+20
469.75/469.98 c GAP 0
469.75/469.98 s UNSATISFIABLE
469.75/469.98 c SCIP Status : problem is solved [infeasible]
469.75/469.98 c Solving Time : 467.01
469.75/469.98 c Original Problem :
469.75/469.98 c Problem name : HOME/instance-1868373-1245122906.opb
469.75/469.98 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
469.75/469.98 c Constraints : 2707 initial, 2707 maximal
469.75/469.98 c Presolved Problem :
469.75/469.98 c Problem name : t_HOME/instance-1868373-1245122906.opb
469.75/469.98 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
469.75/469.98 c Constraints : 2564 initial, 3806 maximal
469.75/469.98 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
469.75/469.98 c trivial : 0.00 0 0 0 0 0 0 0 0
469.75/469.98 c dualfix : 0.00 0 0 0 0 0 0 0 0
469.75/469.98 c boundshift : 0.00 0 0 0 0 0 0 0 0
469.75/469.98 c inttobinary : 0.00 0 0 0 0 0 0 0 0
469.75/469.98 c implics : 0.00 0 0 0 0 0 0 0 0
469.75/469.98 c probing : 0.00 0 0 0 0 0 0 0 0
469.75/469.98 c knapsack : 0.00 0 0 0 0 0 0 0 0
469.75/469.98 c setppc : 0.00 0 0 0 0 0 0 0 0
469.75/469.98 c linear : 0.02 0 0 0 0 0 143 0 0
469.75/469.98 c logicor : 0.03 0 0 0 0 0 0 0 0
469.75/469.98 c root node : - 1 - - 1 - - - -
469.75/469.98 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
469.75/469.98 c integral : 0 0 0 26484 0 172 1682 0 0 50720
469.75/469.98 c knapsack : 1 5 119105 0 0 691 210344 0 0 0
469.75/469.98 c setppc : 22 5 118714 0 0 2295 269012 0 0 0
469.75/469.98 c logicor : 2541+ 5 98319 0 0 890 358309 0 0 0
469.75/469.98 c countsols : 0 0 0 0 0 0 0 0 0 0
469.75/469.98 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
469.75/469.98 c integral : 56.20 0.00 0.00 56.20 0.00
469.75/469.98 c knapsack : 0.70 0.00 0.70 0.00 0.00
469.75/469.98 c setppc : 1.44 0.00 1.44 0.00 0.00
469.75/469.98 c logicor : 8.66 0.00 8.66 0.00 0.00
469.75/469.98 c countsols : 0.00 0.00 0.00 0.00 0.00
469.75/469.98 c Propagators : Time Calls Cutoffs DomReds
469.75/469.98 c rootredcost : 0.11 0 0 0
469.75/469.98 c pseudoobj : 1.63 119418 1 0
469.75/469.98 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
469.75/469.98 c propagation : 0.26 3876 3875 16830 17.1 21 15.4 -
469.75/469.98 c infeasible LP : 0.89 21312 0 0 0.0 0 0.0 0
469.75/469.98 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
469.75/469.98 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
469.75/469.98 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
469.75/469.98 c applied globally : - - - 7991 14.7 - - -
469.75/469.98 c applied locally : - - - 15 32.7 - - -
469.75/469.98 c Separators : Time Calls Cutoffs DomReds Cuts Conss
469.75/469.98 c cut pool : 0.00 4 - - 3 - (maximal pool size: 418)
469.75/469.98 c redcost : 0.49 25589 0 0 0 0
469.75/469.98 c impliedbounds : 0.00 5 0 0 0 0
469.75/469.98 c intobj : 0.00 0 0 0 0 0
469.75/469.98 c gomory : 0.44 5 0 0 2412 0
469.75/469.98 c strongcg : 0.28 5 0 0 2500 0
469.75/469.98 c cmir : 0.00 0 0 0 0 0
469.75/469.98 c flowcover : 0.00 0 0 0 0 0
469.75/469.98 c clique : 0.00 5 0 0 0 0
469.75/469.98 c zerohalf : 0.00 0 0 0 0 0
469.75/469.98 c mcf : 0.00 1 0 0 0 0
469.75/469.98 c Pricers : Time Calls Vars
469.75/469.98 c problem variables: 0.00 0 0
469.75/469.98 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
469.75/469.98 c relpscost : 56.15 26484 172 1682 0 0 50720
469.75/469.98 c pscost : 0.00 0 0 0 0 0 0
469.75/469.98 c inference : 0.00 0 0 0 0 0 0
469.75/469.98 c mostinf : 0.00 0 0 0 0 0 0
469.75/469.98 c leastinf : 0.00 0 0 0 0 0 0
469.75/469.98 c fullstrong : 0.00 0 0 0 0 0 0
469.75/469.98 c allfullstrong : 0.00 0 0 0 0 0 0
469.75/469.98 c random : 0.00 0 0 0 0 0 0
469.75/469.98 c Primal Heuristics : Time Calls Found
469.75/469.98 c LP solutions : 0.00 - 0
469.75/469.98 c pseudo solutions : 0.00 - 0
469.75/469.98 c simplerounding : 0.00 0 0
469.75/469.98 c rounding : 0.00 0 0
469.75/469.98 c shifting : 0.00 0 0
469.75/469.98 c intshifting : 0.00 0 0
469.75/469.98 c oneopt : 0.00 0 0
469.75/469.98 c fixandinfer : 0.00 0 0
469.75/469.98 c feaspump : 0.00 0 0
469.75/469.98 c coefdiving : 0.00 0 0
469.75/469.98 c pscostdiving : 0.00 0 0
469.75/469.98 c fracdiving : 0.00 0 0
469.75/469.98 c veclendiving : 0.00 0 0
469.75/469.98 c intdiving : 0.00 0 0
469.75/469.98 c actconsdiving : 0.00 0 0
469.75/469.98 c objpscostdiving : 0.00 0 0
469.75/469.98 c rootsoldiving : 0.00 0 0
469.75/469.98 c linesearchdiving : 0.00 0 0
469.75/469.98 c guideddiving : 0.00 0 0
469.75/469.98 c octane : 0.00 0 0
469.75/469.98 c rens : 0.00 0 0
469.75/469.98 c rins : 0.00 0 0
469.75/469.98 c localbranching : 0.00 0 0
469.75/469.98 c mutation : 0.00 0 0
469.75/469.98 c crossover : 0.00 0 0
469.75/469.98 c dins : 0.00 0 0
469.75/469.98 c LP : Time Calls Iterations Iter/call Iter/sec
469.75/469.98 c primal LP : 0.01 0 0 0.00 0.00
469.75/469.98 c dual LP : 370.76 47732 1366118 28.62 3684.64
469.75/469.98 c barrier LP : 0.00 0 0 0.00 -
469.75/469.98 c diving/probing LP: 0.00 0 0 0.00 -
469.75/469.98 c strong branching : 55.13 4580 227689 49.71 4130.04
469.75/469.98 c (at root node) : - 22 3507 159.41 -
469.75/469.98 c conflict analysis: 0.00 0 0 0.00 -
469.75/469.98 c B&B Tree :
469.75/469.98 c number of runs : 1
469.75/469.98 c nodes : 50534
469.75/469.98 c nodes (total) : 50534
469.75/469.98 c nodes left : 0
469.75/469.98 c max depth : 61
469.75/469.98 c max depth (total): 61
469.75/469.98 c backtracks : 5449 (10.8%)
469.75/469.98 c delayed cutoffs : 187
469.75/469.98 c repropagations : 9384 (24960 domain reductions, 187 cutoffs)
469.75/469.98 c avg switch length: 4.63
469.75/469.98 c switching time : 8.52
469.75/469.98 c Solution :
469.75/469.98 c Solutions found : 0 (0 improvements)
469.75/469.98 c Primal Bound : infeasible
469.75/469.98 c Dual Bound : -
469.75/469.98 c Gap : 0.00 %
469.75/469.98 c Root Dual Bound : +1.10000000000000e+01
469.75/469.99 c Time complete: 469.85.