0.00/0.01 c SCIP version 1.1.0.7
0.00/0.01 c LP-Solver Clp 1.8.2
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c read problem <HOME/instance-1883983-1245239447.opb>
0.00/0.01 c original problem has 110 variables (110 bin, 0 int, 0 impl, 0 cont) and 561 constraints
0.01/0.02 c No objective function, only one solution is needed.
0.01/0.02 c start presolving problem
0.01/0.02 c presolving:
0.01/0.04 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 561 upgd conss, 1100 impls, 0 clqs
0.01/0.04 c presolving (2 rounds):
0.01/0.04 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.04 c 1100 implications, 0 cliques
0.01/0.04 c presolved problem has 110 variables (110 bin, 0 int, 0 impl, 0 cont) and 561 constraints
0.01/0.04 c 561 constraints of type <logicor>
0.01/0.04 c transformed objective value is always integral (scale: 1)
0.01/0.04 c Presolving Time: 0.02
0.01/0.04 c PURESAT
0.01/0.04 c -----------------------------------------------------------------------------------------------
0.01/0.04 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.04 c separating/flowcover/freq = c -1
0.01/0.04 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.04 c separating/cmir/freq = c -1
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/veclendiving/maxlpiterofs = c 1500
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.01/0.04 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/veclendiving/freq = c -1
0.01/0.04 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.04 c heuristics/simplerounding/freq = c -1
0.01/0.04 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/shifting/freq = c -1
0.01/0.04 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.04 c heuristics/rounding/freq = c -1
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.01/0.04 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.01/0.04 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.04 c heuristics/rootsoldiving/freq = c -1
0.01/0.04 c # number of nodes added to the contingent of the total nodes
0.01/0.04 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.04 c heuristics/rens/nodesofs = c 2000
0.01/0.04 c # minimum percentage of integer variables that have to be fixable
0.01/0.04 c # [type: real, range: [0,1], default: 0.5]
0.01/0.04 c heuristics/rens/minfixingrate = c 0.3
0.01/0.04 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.04 c heuristics/rens/freq = c -1
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.01/0.04 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/pscostdiving/freq = c -1
0.01/0.04 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.04 c heuristics/oneopt/freq = c -1
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.01/0.04 c # maximal fraction of diving LP iterations compared to total iteration number
0.01/0.04 c # [type: real, range: [0,1], default: 0.01]
0.01/0.04 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.01/0.04 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.04 c heuristics/objpscostdiving/freq = c -1
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.01/0.04 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/linesearchdiving/freq = c -1
0.01/0.04 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/intshifting/freq = c -1
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04 c heuristics/intdiving/maxlpiterquot = c 0.075
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/guideddiving/maxlpiterofs = c 1500
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.01/0.04 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/guideddiving/freq = c -1
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/fracdiving/maxlpiterofs = c 1500
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.01/0.04 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/fracdiving/freq = c -1
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/feaspump/maxlpiterofs = c 2000
0.01/0.04 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.04 c heuristics/feaspump/freq = c -1
0.01/0.04 c # minimum percentage of integer variables that have to be fixed
0.01/0.04 c # [type: real, range: [0,1], default: 0.666]
0.01/0.04 c heuristics/crossover/minfixingrate = c 0.5
0.01/0.04 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.01/0.04 c # [type: real, range: [0,1], default: 0.1]
0.01/0.04 c heuristics/crossover/nodesquot = c 0.15
0.01/0.04 c # number of nodes without incumbent change that heuristic should wait
0.01/0.04 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.01/0.04 c heuristics/crossover/nwaitingnodes = c 100
0.01/0.04 c # number of nodes added to the contingent of the total nodes
0.01/0.04 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.04 c heuristics/crossover/nodesofs = c 750
0.01/0.04 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 30]
0.01/0.04 c heuristics/crossover/freq = c -1
0.01/0.04 c # additional number of allowed LP iterations
0.01/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.04 c heuristics/coefdiving/maxlpiterofs = c 1500
0.01/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.04 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.01/0.04 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.04 c heuristics/coefdiving/freq = c -1
0.01/0.04 c # priority of node selection rule <dfs> in standard mode
0.01/0.04 c # [type: int, range: [-536870912,536870911], default: 0]
0.01/0.04 c nodeselection/dfs/stdpriority = c 1000000
0.01/0.04 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c presolving/probing/maxrounds = c 0
0.01/0.04 c # should presolving try to simplify knapsacks
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/knapsack/simplifyinequalities = c TRUE
0.01/0.04 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.01/0.04 c constraints/knapsack/disaggregation = c FALSE
0.01/0.04 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c constraints/knapsack/maxnumcardlift = c 0
0.01/0.04 c # should presolving try to simplify inequalities
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/linear/simplifyinequalities = c TRUE
0.01/0.04 c # maximal number of separation rounds in the root node (-1: unlimited)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c separating/maxroundsroot = c 5
0.01/0.04 c # maximal number of separation rounds per node (-1: unlimited)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 5]
0.01/0.04 c separating/maxrounds = c 1
0.01/0.04 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.01/0.04 c # [type: char, range: {lafpsqd}, default: l]
0.01/0.04 c lp/pricing = c a
0.01/0.04 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.04 c lp/solvefreq = c 0
0.01/0.04 c # solving stops, if the given number of solutions were found (-1: no limit)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c limits/solutions = c 1
0.01/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04 c limits/memory = c 1620
0.01/0.04 c # maximal time in seconds to run
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04 c limits/time = c 1791
0.01/0.04 c # frequency for displaying node information lines
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.04 c display/freq = c 10000
0.01/0.04 c # should enforcement of pseudo solution be disabled?
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/disableenfops = c TRUE
0.01/0.04 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.04 c constraints/agelimit = c 1
0.01/0.04 c # should binary conflicts be preferred?
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c conflict/preferbinary = c TRUE
0.01/0.04 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c conflict/interconss = c 0
0.01/0.04 c -----------------------------------------------------------------------------------------------
0.01/0.04 c start solving problem
0.01/0.04 c
0.01/0.04 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.01/0.04 c 0.0s| 1 | 0 | 22 | 980k| 0 | 22 | 110 | 561 | 561 | 110 | 561 | 0 | 0 | 0 | 1.100000e+01 | -- | Inf
0.01/0.05 c 0.0s| 1 | 0 | 74 | 981k| 0 | 22 | 110 | 561 | 561 | 110 | 563 | 2 | 0 | 0 | 1.100000e+01 | -- | Inf
0.01/0.06 c 0.0s| 1 | 0 | 123 | 984k| 0 | 20 | 110 | 561 | 561 | 110 | 566 | 5 | 0 | 0 | 1.100000e+01 | -- | Inf
0.01/0.08 c 0.1s| 1 | 0 | 145 | 993k| 0 | 21 | 110 | 561 | 561 | 110 | 569 | 8 | 0 | 0 | 1.100000e+01 | -- | Inf
0.09/0.10 c 0.1s| 1 | 0 | 156 |1013k| 0 | 6 | 110 | 561 | 561 | 110 | 574 | 13 | 0 | 0 | 1.100000e+01 | -- | Inf
0.09/0.11 c 0.1s| 1 | 0 | 165 |1028k| 0 | 21 | 110 | 561 | 561 | 110 | 576 | 15 | 0 | 0 | 1.100000e+01 | -- | Inf
0.09/0.14 c 0.1s| 1 | 0 | 183 |1026k| 0 | 18 | 110 | 561 | 561 | 110 | 576 | 15 | 0 | 20 | 1.100000e+01 | -- | Inf
0.09/0.15 c 0.1s| 1 | 0 | 199 |1024k| 0 | - | 110 | 561 | 561 | 110 | 576 | 15 | 0 | 29 | -- | -- | 0.00%
0.09/0.15 c 0.1s| 1 | 0 | 199 |1024k| 0 | - | 110 | 561 | 561 | 110 | 576 | 15 | 0 | 29 | -- | -- | 0.00%
0.09/0.15 c
0.09/0.15 c SCIP Status : problem is solved [infeasible]
0.09/0.15 c Solving Time (sec) : 0.12
0.09/0.15 c Solving Nodes : 1
0.09/0.15 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.09/0.15 c Dual Bound : +1.00000000000000e+20
0.09/0.15 c Gap : 0.00 %
0.09/0.15 c NODE 1
0.09/0.15 c DUAL BOUND 1e+20
0.09/0.15 c PRIMAL BOUND 1e+20
0.09/0.15 c GAP 0
0.09/0.15 s UNSATISFIABLE
0.09/0.15 c SCIP Status : problem is solved [infeasible]
0.09/0.15 c Solving Time : 0.12
0.09/0.15 c Original Problem :
0.09/0.15 c Problem name : HOME/instance-1883983-1245239447.opb
0.09/0.15 c Variables : 110 (110 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.15 c Constraints : 561 initial, 561 maximal
0.09/0.15 c Presolved Problem :
0.09/0.15 c Problem name : t_HOME/instance-1883983-1245239447.opb
0.09/0.15 c Variables : 110 (110 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.15 c Constraints : 561 initial, 561 maximal
0.09/0.15 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.09/0.15 c trivial : 0.00 0 0 0 0 0 0 0 0
0.09/0.15 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.09/0.15 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.09/0.15 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.09/0.15 c implics : 0.00 0 0 0 0 0 0 0 0
0.09/0.15 c probing : 0.00 0 0 0 0 0 0 0 0
0.09/0.15 c logicor : 0.01 0 0 0 0 0 0 0 0
0.09/0.15 c root node : - 9 - - 9 - - - -
0.09/0.15 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.09/0.15 c integral : 0 0 0 2 0 0 9 0 0 0
0.09/0.15 c logicor : 561 5 1 0 0 0 0 0 0 0
0.09/0.15 c countsols : 0 0 0 0 0 0 0 0 0 0
0.09/0.15 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.09/0.15 c integral : 0.03 0.00 0.00 0.03 0.00
0.09/0.15 c logicor : 0.00 0.00 0.00 0.00 0.00
0.09/0.15 c countsols : 0.00 0.00 0.00 0.00 0.00
0.09/0.15 c Propagators : Time Calls Cutoffs DomReds
0.09/0.15 c rootredcost : 0.00 0 0 0
0.09/0.15 c pseudoobj : 0.00 5 1 0
0.09/0.15 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.09/0.15 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.15 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.15 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.15 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.15 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.15 c applied globally : - - - 0 0.0 - - -
0.09/0.15 c applied locally : - - - 0 0.0 - - -
0.09/0.15 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.09/0.15 c cut pool : 0.00 4 - - 1 - (maximal pool size: 45)
0.09/0.15 c redcost : 0.00 5 0 0 0 0
0.09/0.15 c impliedbounds : 0.00 5 0 0 0 0
0.09/0.15 c intobj : 0.00 0 0 0 0 0
0.09/0.15 c gomory : 0.01 5 0 0 587 0
0.09/0.15 c strongcg : 0.04 5 0 0 587 0
0.09/0.15 c cmir : 0.00 0 0 0 0 0
0.09/0.15 c flowcover : 0.00 0 0 0 0 0
0.09/0.15 c clique : 0.00 5 0 0 11 0
0.09/0.15 c zerohalf : 0.00 0 0 0 0 0
0.09/0.15 c mcf : 0.00 1 0 0 0 0
0.09/0.15 c Pricers : Time Calls Vars
0.09/0.15 c problem variables: 0.00 0 0
0.09/0.15 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.09/0.15 c relpscost : 0.03 2 0 9 0 0 0
0.09/0.15 c pscost : 0.00 0 0 0 0 0 0
0.09/0.15 c inference : 0.00 0 0 0 0 0 0
0.09/0.15 c mostinf : 0.00 0 0 0 0 0 0
0.09/0.15 c leastinf : 0.00 0 0 0 0 0 0
0.09/0.15 c fullstrong : 0.00 0 0 0 0 0 0
0.09/0.15 c allfullstrong : 0.00 0 0 0 0 0 0
0.09/0.15 c random : 0.00 0 0 0 0 0 0
0.09/0.15 c Primal Heuristics : Time Calls Found
0.09/0.15 c LP solutions : 0.00 - 0
0.09/0.15 c pseudo solutions : 0.00 - 0
0.09/0.15 c simplerounding : 0.00 0 0
0.09/0.15 c rounding : 0.00 0 0
0.09/0.15 c shifting : 0.00 0 0
0.09/0.15 c intshifting : 0.00 0 0
0.09/0.15 c oneopt : 0.00 0 0
0.09/0.15 c fixandinfer : 0.00 0 0
0.09/0.15 c feaspump : 0.00 0 0
0.09/0.15 c coefdiving : 0.00 0 0
0.09/0.15 c pscostdiving : 0.00 0 0
0.09/0.15 c fracdiving : 0.00 0 0
0.09/0.15 c veclendiving : 0.00 0 0
0.09/0.15 c intdiving : 0.00 0 0
0.09/0.15 c actconsdiving : 0.00 0 0
0.09/0.15 c objpscostdiving : 0.00 0 0
0.09/0.15 c rootsoldiving : 0.00 0 0
0.09/0.15 c linesearchdiving : 0.00 0 0
0.09/0.15 c guideddiving : 0.00 0 0
0.09/0.15 c octane : 0.00 0 0
0.09/0.15 c rens : 0.00 0 0
0.09/0.15 c rins : 0.00 0 0
0.09/0.15 c localbranching : 0.00 0 0
0.09/0.15 c mutation : 0.00 0 0
0.09/0.15 c crossover : 0.00 0 0
0.09/0.15 c dins : 0.00 0 0
0.09/0.15 c LP : Time Calls Iterations Iter/call Iter/sec
0.09/0.15 c primal LP : 0.00 0 0 0.00 -
0.09/0.15 c dual LP : 0.01 8 199 24.88 19900.00
0.09/0.15 c barrier LP : 0.00 0 0 0.00 -
0.09/0.15 c diving/probing LP: 0.00 0 0 0.00 -
0.09/0.15 c strong branching : 0.03 29 318 10.97 10600.00
0.09/0.15 c (at root node) : - 29 318 10.97 -
0.09/0.15 c conflict analysis: 0.00 0 0 0.00 -
0.09/0.15 c B&B Tree :
0.09/0.15 c number of runs : 1
0.09/0.15 c nodes : 1
0.09/0.15 c nodes (total) : 1
0.09/0.15 c nodes left : 0
0.09/0.15 c max depth : 0
0.09/0.15 c max depth (total): 0
0.09/0.15 c backtracks : 0 (0.0%)
0.09/0.15 c delayed cutoffs : 0
0.09/0.15 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.09/0.15 c avg switch length: 2.00
0.09/0.15 c switching time : 0.00
0.09/0.15 c Solution :
0.09/0.15 c Solutions found : 0 (0 improvements)
0.09/0.15 c Primal Bound : infeasible
0.09/0.15 c Dual Bound : -
0.09/0.15 c Gap : 0.00 %
0.09/0.15 c Root Dual Bound : -
0.09/0.15 c Time complete: 0.15.