0.18/0.28 c SCIP version 1.1.0.7
0.18/0.28 c LP-Solver SoPlex 1.4.1
0.18/0.28 c user parameter file <scip.set> not found - using default parameters
0.18/0.28 c read problem <HOME/instance-3739860-1338757237.opb>
0.18/0.28 c original problem has 14924 variables (14924 bin, 0 int, 0 impl, 0 cont) and 46889 constraints
0.29/0.36 c No objective function, only one solution is needed.
0.29/0.36 c start presolving problem
0.29/0.36 c presolving:
1.19/1.22 c (round 1) 3476 del vars, 9808 del conss, 2369 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2562452 impls, 0 clqs
1.49/1.56 c (round 2) 7897 del vars, 25310 del conss, 6439 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2586219 impls, 0 clqs
1.58/1.61 c (round 3) 9069 del vars, 30738 del conss, 7105 chg bounds, 47 chg sides, 38 chg coeffs, 0 upgd conss, 2593543 impls, 0 clqs
1.58/1.64 c (round 4) 9689 del vars, 32757 del conss, 7457 chg bounds, 79 chg sides, 66 chg coeffs, 0 upgd conss, 2599226 impls, 0 clqs
1.58/1.66 c (round 5) 10074 del vars, 34022 del conss, 7702 chg bounds, 79 chg sides, 66 chg coeffs, 0 upgd conss, 2603343 impls, 0 clqs
1.58/1.67 c (round 6) 10325 del vars, 34810 del conss, 7839 chg bounds, 79 chg sides, 66 chg coeffs, 0 upgd conss, 2606581 impls, 0 clqs
1.58/1.68 c (round 7) 10530 del vars, 35527 del conss, 7967 chg bounds, 79 chg sides, 66 chg coeffs, 0 upgd conss, 2608617 impls, 0 clqs
1.58/1.69 c (round 8) 10621 del vars, 35865 del conss, 8015 chg bounds, 79 chg sides, 66 chg coeffs, 0 upgd conss, 2609369 impls, 0 clqs
1.68/1.70 c (round 9) 10677 del vars, 36053 del conss, 8035 chg bounds, 79 chg sides, 66 chg coeffs, 0 upgd conss, 2611111 impls, 0 clqs
1.68/1.70 c (round 10) 10695 del vars, 36145 del conss, 8044 chg bounds, 80 chg sides, 67 chg coeffs, 0 upgd conss, 2611245 impls, 0 clqs
1.68/1.71 c (round 11) 10701 del vars, 36176 del conss, 8047 chg bounds, 84 chg sides, 70 chg coeffs, 0 upgd conss, 2611257 impls, 0 clqs
1.68/1.71 c (round 12) 10704 del vars, 36189 del conss, 8047 chg bounds, 84 chg sides, 70 chg coeffs, 0 upgd conss, 2611271 impls, 0 clqs
1.68/1.75 c (round 13) 10704 del vars, 36190 del conss, 8047 chg bounds, 84 chg sides, 70 chg coeffs, 10699 upgd conss, 2611271 impls, 0 clqs
1.68/1.79 c (round 14) 10704 del vars, 36190 del conss, 8047 chg bounds, 90 chg sides, 99 chg coeffs, 10699 upgd conss, 2611411 impls, 100 clqs
1.79/1.82 c presolving (15 rounds):
1.79/1.82 c 10704 deleted vars, 36190 deleted constraints, 8047 tightened bounds, 0 added holes, 90 changed sides, 104 changed coefficients
1.79/1.82 c 2611411 implications, 101 cliques
1.79/1.82 c presolved problem has 4220 variables (4220 bin, 0 int, 0 impl, 0 cont) and 10699 constraints
1.79/1.82 c 261 constraints of type <knapsack>
1.79/1.82 c 10438 constraints of type <logicor>
1.79/1.82 c transformed objective value is always integral (scale: 1)
1.79/1.82 c Presolving Time: 1.39
1.79/1.82 c SATUNSAT-LIN
1.79/1.82 c -----------------------------------------------------------------------------------------------
1.79/1.82 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.79/1.82 c # [type: int, range: [-1,2147483647], default: 0]
1.79/1.82 c separating/flowcover/freq = c -1
1.79/1.82 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.79/1.82 c # [type: int, range: [-1,2147483647], default: 0]
1.79/1.82 c separating/cmir/freq = c -1
1.79/1.82 c # additional number of allowed LP iterations
1.79/1.82 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.82 c heuristics/veclendiving/maxlpiterofs = c 1500
1.79/1.82 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.82 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.82 c heuristics/veclendiving/maxlpiterquot = c 0.075
1.79/1.82 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.79/1.82 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.82 c heuristics/veclendiving/freq = c -1
1.79/1.82 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.79/1.82 c # [type: int, range: [-1,2147483647], default: 1]
1.79/1.82 c heuristics/simplerounding/freq = c -1
1.79/1.82 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.79/1.82 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.82 c heuristics/shifting/freq = c -1
1.79/1.82 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.79/1.82 c # [type: int, range: [-1,2147483647], default: 1]
1.79/1.82 c heuristics/rounding/freq = c -1
1.79/1.82 c # additional number of allowed LP iterations
1.79/1.82 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.82 c heuristics/rootsoldiving/maxlpiterofs = c 1500
1.79/1.82 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.82 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.79/1.82 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
1.79/1.82 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.79/1.82 c # [type: int, range: [-1,2147483647], default: 20]
1.79/1.82 c heuristics/rootsoldiving/freq = c -1
1.79/1.82 c # number of nodes added to the contingent of the total nodes
1.79/1.82 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.79/1.82 c heuristics/rens/nodesofs = c 2000
1.79/1.82 c # minimum percentage of integer variables that have to be fixable
1.79/1.82 c # [type: real, range: [0,1], default: 0.5]
1.79/1.82 c heuristics/rens/minfixingrate = c 0.3
1.79/1.82 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.79/1.82 c # [type: int, range: [-1,2147483647], default: 0]
1.79/1.82 c heuristics/rens/freq = c -1
1.79/1.82 c # additional number of allowed LP iterations
1.79/1.82 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.82 c heuristics/pscostdiving/maxlpiterofs = c 1500
1.79/1.82 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.82 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.82 c heuristics/pscostdiving/maxlpiterquot = c 0.075
1.79/1.82 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.79/1.82 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.82 c heuristics/pscostdiving/freq = c -1
1.79/1.82 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.79/1.82 c # [type: int, range: [-1,2147483647], default: 1]
1.79/1.82 c heuristics/oneopt/freq = c -1
1.79/1.82 c # additional number of allowed LP iterations
1.79/1.82 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.82 c heuristics/objpscostdiving/maxlpiterofs = c 1500
1.79/1.82 c # maximal fraction of diving LP iterations compared to total iteration number
1.79/1.82 c # [type: real, range: [0,1], default: 0.01]
1.79/1.82 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
1.79/1.82 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.79/1.82 c # [type: int, range: [-1,2147483647], default: 20]
1.79/1.82 c heuristics/objpscostdiving/freq = c -1
1.79/1.82 c # additional number of allowed LP iterations
1.79/1.82 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.82 c heuristics/linesearchdiving/maxlpiterofs = c 1500
1.79/1.82 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.82 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.82 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
1.79/1.82 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.79/1.82 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.82 c heuristics/linesearchdiving/freq = c -1
1.79/1.82 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.79/1.82 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.82 c heuristics/intshifting/freq = c -1
1.79/1.82 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.82 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.82 c heuristics/intdiving/maxlpiterquot = c 0.075
1.79/1.82 c # additional number of allowed LP iterations
1.79/1.82 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.82 c heuristics/guideddiving/maxlpiterofs = c 1500
1.79/1.82 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.82 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.82 c heuristics/guideddiving/maxlpiterquot = c 0.075
1.79/1.82 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.79/1.82 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.82 c heuristics/guideddiving/freq = c -1
1.79/1.82 c # additional number of allowed LP iterations
1.79/1.82 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.82 c heuristics/fracdiving/maxlpiterofs = c 1500
1.79/1.82 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.82 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.82 c heuristics/fracdiving/maxlpiterquot = c 0.075
1.79/1.82 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.79/1.82 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.82 c heuristics/fracdiving/freq = c -1
1.79/1.82 c # additional number of allowed LP iterations
1.79/1.82 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.82 c heuristics/feaspump/maxlpiterofs = c 2000
1.79/1.82 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.79/1.82 c # [type: int, range: [-1,2147483647], default: 20]
1.79/1.82 c heuristics/feaspump/freq = c -1
1.79/1.82 c # minimum percentage of integer variables that have to be fixed
1.79/1.82 c # [type: real, range: [0,1], default: 0.666]
1.79/1.82 c heuristics/crossover/minfixingrate = c 0.5
1.79/1.82 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.79/1.82 c # [type: real, range: [0,1], default: 0.1]
1.79/1.82 c heuristics/crossover/nodesquot = c 0.15
1.79/1.82 c # number of nodes without incumbent change that heuristic should wait
1.79/1.82 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.79/1.82 c heuristics/crossover/nwaitingnodes = c 100
1.79/1.82 c # number of nodes added to the contingent of the total nodes
1.79/1.82 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.79/1.82 c heuristics/crossover/nodesofs = c 750
1.79/1.82 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.79/1.82 c # [type: int, range: [-1,2147483647], default: 30]
1.79/1.82 c heuristics/crossover/freq = c -1
1.79/1.82 c # additional number of allowed LP iterations
1.79/1.82 c # [type: int, range: [0,2147483647], default: 1000]
1.79/1.82 c heuristics/coefdiving/maxlpiterofs = c 1500
1.79/1.82 c # maximal fraction of diving LP iterations compared to node LP iterations
1.79/1.82 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.79/1.82 c heuristics/coefdiving/maxlpiterquot = c 0.075
1.79/1.82 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.79/1.82 c # [type: int, range: [-1,2147483647], default: 10]
1.79/1.82 c heuristics/coefdiving/freq = c -1
1.79/1.82 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.79/1.82 c # [type: int, range: [-1,2147483647], default: -1]
1.79/1.82 c presolving/probing/maxrounds = c 0
1.79/1.82 c # should presolving try to simplify knapsacks
1.79/1.82 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.79/1.82 c constraints/knapsack/simplifyinequalities = c TRUE
1.79/1.82 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.79/1.82 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.79/1.82 c constraints/knapsack/disaggregation = c FALSE
1.79/1.82 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
1.79/1.82 c # [type: int, range: [-1,2147483647], default: -1]
1.79/1.82 c constraints/knapsack/maxnumcardlift = c 0
1.79/1.82 c # should presolving try to simplify inequalities
1.79/1.82 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.79/1.82 c constraints/linear/simplifyinequalities = c TRUE
1.79/1.82 c # maximal number of separation rounds in the root node (-1: unlimited)
1.79/1.82 c # [type: int, range: [-1,2147483647], default: -1]
1.79/1.82 c separating/maxroundsroot = c 5
1.79/1.82 c # maximal number of separation rounds per node (-1: unlimited)
1.79/1.82 c # [type: int, range: [-1,2147483647], default: 5]
1.79/1.82 c separating/maxrounds = c 1
1.79/1.82 c # solving stops, if the given number of solutions were found (-1: no limit)
1.79/1.82 c # [type: int, range: [-1,2147483647], default: -1]
1.79/1.82 c limits/solutions = c 1
1.79/1.82 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.79/1.82 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.79/1.82 c limits/memory = c 13950
1.79/1.82 c # maximal time in seconds to run
1.79/1.82 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.79/1.82 c limits/time = c 1791
1.79/1.82 c # frequency for displaying node information lines
1.79/1.82 c # [type: int, range: [-1,2147483647], default: 100]
1.79/1.82 c display/freq = c 10000
1.79/1.82 c -----------------------------------------------------------------------------------------------
1.79/1.82 c start solving problem
1.79/1.82 c
6.88/6.92 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
6.88/6.92 c 6.5s| 1 | 0 | 6616 | 70M| 0 | - |4220 | 10k| 10k|4220 | 10k| 0 | 0 | 0 | -- | -- | 0.00%
6.88/6.92 c 6.5s| 1 | 0 | 6616 | 70M| 0 | - |4220 | 10k| 10k|4220 | 10k| 0 | 0 | 0 | -- | -- | 0.00%
6.88/6.92 c
6.88/6.92 c SCIP Status : problem is solved [infeasible]
6.88/6.92 c Solving Time (sec) : 6.53
6.88/6.92 c Solving Nodes : 1
6.88/6.92 c Primal Bound : +1.00000000000000e+20 (0 solutions)
6.88/6.92 c Dual Bound : +1.00000000000000e+20
6.88/6.92 c Gap : 0.00 %
6.88/6.92 c NODE 1
6.88/6.92 c DUAL BOUND 1e+20
6.88/6.92 c PRIMAL BOUND 1e+20
6.88/6.92 c GAP 0
6.88/6.92 s UNSATISFIABLE
6.88/6.92 c SCIP Status : problem is solved [infeasible]
6.88/6.92 c Solving Time : 6.53
6.88/6.92 c Original Problem :
6.88/6.92 c Problem name : HOME/instance-3739860-1338757237.opb
6.88/6.92 c Variables : 14924 (14924 binary, 0 integer, 0 implicit integer, 0 continuous)
6.88/6.92 c Constraints : 46889 initial, 46889 maximal
6.88/6.92 c Presolved Problem :
6.88/6.92 c Problem name : t_HOME/instance-3739860-1338757237.opb
6.88/6.92 c Variables : 4220 (4220 binary, 0 integer, 0 implicit integer, 0 continuous)
6.88/6.92 c Constraints : 10699 initial, 10699 maximal
6.88/6.92 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
6.88/6.92 c trivial : 0.00 488 0 0 0 0 0 0 0
6.88/6.92 c dualfix : 0.00 2 0 0 0 0 0 0 0
6.88/6.92 c boundshift : 0.00 0 0 0 0 0 0 0 0
6.88/6.92 c inttobinary : 0.00 0 0 0 0 0 0 0 0
6.88/6.92 c implics : 0.02 0 12 0 0 0 0 0 0
6.88/6.92 c probing : 0.00 0 0 0 0 0 0 0 0
6.88/6.92 c knapsack : 0.04 0 0 0 0 0 0 6 34
6.88/6.92 c linear : 1.26 7559 2643 0 8047 0 36190 84 70
6.88/6.92 c logicor : 0.02 0 0 0 0 0 0 0 0
6.88/6.92 c root node : - 0 - - 0 - - - -
6.88/6.92 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
6.88/6.92 c integral : 0 0 0 0 0 0 0 0 0 0
6.88/6.92 c knapsack : 261 0 1 0 0 0 0 0 0 0
6.88/6.92 c logicor : 10438 0 1 0 0 0 0 0 0 0
6.88/6.92 c countsols : 0 0 0 0 0 0 0 0 0 0
6.88/6.92 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
6.88/6.92 c integral : 0.00 0.00 0.00 0.00 0.00
6.88/6.92 c knapsack : 0.00 0.00 0.00 0.00 0.00
6.88/6.92 c logicor : 0.00 0.00 0.00 0.00 0.00
6.88/6.92 c countsols : 0.00 0.00 0.00 0.00 0.00
6.88/6.92 c Propagators : Time Calls Cutoffs DomReds
6.88/6.92 c rootredcost : 0.00 0 0 0
6.88/6.92 c pseudoobj : 0.00 2 1 0
6.88/6.92 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
6.88/6.92 c propagation : 0.00 0 0 0 0.0 0 0.0 -
6.88/6.92 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
6.88/6.92 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
6.88/6.92 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
6.88/6.92 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
6.88/6.92 c applied globally : - - - 0 0.0 - - -
6.88/6.92 c applied locally : - - - 0 0.0 - - -
6.88/6.92 c Separators : Time Calls Cutoffs DomReds Cuts Conss
6.88/6.92 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
6.88/6.92 c redcost : 0.00 0 0 0 0 0
6.88/6.92 c impliedbounds : 0.00 0 0 0 0 0
6.88/6.92 c intobj : 0.00 0 0 0 0 0
6.88/6.92 c gomory : 0.00 0 0 0 0 0
6.88/6.92 c strongcg : 0.00 0 0 0 0 0
6.88/6.92 c cmir : 0.00 0 0 0 0 0
6.88/6.92 c flowcover : 0.00 0 0 0 0 0
6.88/6.92 c clique : 0.00 0 0 0 0 0
6.88/6.92 c zerohalf : 0.00 0 0 0 0 0
6.88/6.92 c mcf : 0.00 0 0 0 0 0
6.88/6.92 c Pricers : Time Calls Vars
6.88/6.92 c problem variables: 0.00 0 0
6.88/6.92 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
6.88/6.92 c pscost : 0.00 0 0 0 0 0 0
6.88/6.92 c inference : 0.00 0 0 0 0 0 0
6.88/6.92 c mostinf : 0.00 0 0 0 0 0 0
6.88/6.92 c leastinf : 0.00 0 0 0 0 0 0
6.88/6.92 c fullstrong : 0.00 0 0 0 0 0 0
6.88/6.92 c allfullstrong : 0.00 0 0 0 0 0 0
6.88/6.92 c random : 0.00 0 0 0 0 0 0
6.88/6.92 c relpscost : 0.00 0 0 0 0 0 0
6.88/6.92 c Primal Heuristics : Time Calls Found
6.88/6.92 c LP solutions : 0.00 - 0
6.88/6.92 c pseudo solutions : 0.00 - 0
6.88/6.92 c simplerounding : 0.00 0 0
6.88/6.92 c rounding : 0.00 0 0
6.88/6.92 c shifting : 0.00 0 0
6.88/6.92 c intshifting : 0.00 0 0
6.88/6.92 c oneopt : 0.00 0 0
6.88/6.92 c fixandinfer : 0.00 0 0
6.88/6.92 c feaspump : 0.00 0 0
6.88/6.92 c coefdiving : 0.00 0 0
6.88/6.92 c pscostdiving : 0.00 0 0
6.88/6.92 c fracdiving : 0.00 0 0
6.88/6.92 c veclendiving : 0.00 0 0
6.88/6.92 c intdiving : 0.00 0 0
6.88/6.92 c actconsdiving : 0.00 0 0
6.88/6.92 c objpscostdiving : 0.00 0 0
6.88/6.92 c rootsoldiving : 0.00 0 0
6.88/6.92 c linesearchdiving : 0.00 0 0
6.88/6.92 c guideddiving : 0.00 0 0
6.88/6.92 c octane : 0.00 0 0
6.88/6.92 c rens : 0.00 0 0
6.88/6.92 c rins : 0.00 0 0
6.88/6.92 c localbranching : 0.00 0 0
6.88/6.92 c mutation : 0.00 0 0
6.88/6.92 c crossover : 0.00 0 0
6.88/6.92 c dins : 0.00 0 0
6.88/6.92 c LP : Time Calls Iterations Iter/call Iter/sec
6.88/6.92 c primal LP : 0.00 0 0 0.00 -
6.88/6.92 c dual LP : 5.07 1 6616 6616.00 1304.93
6.88/6.92 c barrier LP : 0.00 0 0 0.00 -
6.88/6.92 c diving/probing LP: 0.00 0 0 0.00 -
6.88/6.92 c strong branching : 0.00 0 0 0.00 -
6.88/6.92 c (at root node) : - 0 0 0.00 -
6.88/6.92 c conflict analysis: 0.00 0 0 0.00 -
6.88/6.92 c B&B Tree :
6.88/6.92 c number of runs : 1
6.88/6.92 c nodes : 1
6.88/6.92 c nodes (total) : 1
6.88/6.92 c nodes left : 0
6.88/6.92 c max depth : 0
6.88/6.92 c max depth (total): 0
6.88/6.92 c backtracks : 0 (0.0%)
6.88/6.92 c delayed cutoffs : 0
6.88/6.92 c repropagations : 0 (0 domain reductions, 0 cutoffs)
6.88/6.92 c avg switch length: 2.00
6.88/6.92 c switching time : 0.00
6.88/6.92 c Solution :
6.88/6.92 c Solutions found : 0 (0 improvements)
6.88/6.92 c Primal Bound : infeasible
6.88/6.92 c Dual Bound : -
6.88/6.92 c Gap : 0.00 %
6.88/6.92 c Root Dual Bound : -
6.88/6.99 c Time complete: 6.98.