0.00/0.00 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
0.00/0.00 c Copyright (c) 2002-2011 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-3486149-1307791684.opb>
0.39/0.48 c original problem has 27588 variables (27588 bin, 0 int, 0 impl, 0 cont) and 91561 constraints
0.39/0.48 c problem read
0.39/0.48 c No objective function, only one solution is needed.
0.39/0.48 c presolving settings loaded
0.69/0.76 c presolving:
2.89/2.97 c (round 1) 6141 del vars, 17746 del conss, 0 add conss, 4615 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 5219916 impls, 0 clqs
3.79/3.83 c (round 2) 13070 del vars, 45342 del conss, 0 add conss, 11138 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 5257338 impls, 0 clqs
3.89/3.95 c (round 3) 15543 del vars, 56491 del conss, 0 add conss, 12547 chg bounds, 65 chg sides, 57 chg coeffs, 0 upgd conss, 5277181 impls, 0 clqs
3.99/4.01 c (round 4) 16597 del vars, 60278 del conss, 0 add conss, 13317 chg bounds, 87 chg sides, 81 chg coeffs, 0 upgd conss, 5285769 impls, 0 clqs
3.99/4.06 c (round 5) 17662 del vars, 63443 del conss, 0 add conss, 14012 chg bounds, 87 chg sides, 81 chg coeffs, 0 upgd conss, 5299079 impls, 0 clqs
4.09/4.11 c (round 6) 18568 del vars, 66373 del conss, 0 add conss, 14601 chg bounds, 87 chg sides, 81 chg coeffs, 0 upgd conss, 5310271 impls, 0 clqs
4.09/4.13 c (round 7) 19170 del vars, 68460 del conss, 0 add conss, 15007 chg bounds, 87 chg sides, 81 chg coeffs, 0 upgd conss, 5316042 impls, 0 clqs
4.09/4.15 c (round 8) 19504 del vars, 69656 del conss, 0 add conss, 15212 chg bounds, 87 chg sides, 81 chg coeffs, 0 upgd conss, 5319678 impls, 0 clqs
4.09/4.17 c (round 9) 19718 del vars, 70430 del conss, 0 add conss, 15333 chg bounds, 87 chg sides, 81 chg coeffs, 0 upgd conss, 5322374 impls, 0 clqs
4.09/4.18 c (round 10) 19827 del vars, 70885 del conss, 0 add conss, 15393 chg bounds, 87 chg sides, 81 chg coeffs, 0 upgd conss, 5323568 impls, 0 clqs
4.09/4.19 c (round 11) 19911 del vars, 71201 del conss, 0 add conss, 15451 chg bounds, 87 chg sides, 81 chg coeffs, 0 upgd conss, 5324245 impls, 0 clqs
4.09/4.19 c (round 12) 19933 del vars, 71313 del conss, 0 add conss, 15451 chg bounds, 87 chg sides, 81 chg coeffs, 0 upgd conss, 5324685 impls, 0 clqs
4.19/4.20 c (round 13) 19933 del vars, 71332 del conss, 0 add conss, 15451 chg bounds, 87 chg sides, 81 chg coeffs, 0 upgd conss, 5324685 impls, 0 clqs
4.19/4.29 c (round 14) 19933 del vars, 71332 del conss, 0 add conss, 15451 chg bounds, 87 chg sides, 81 chg coeffs, 20229 upgd conss, 5324685 impls, 0 clqs
4.29/4.36 c (round 15) 19933 del vars, 71332 del conss, 0 add conss, 15451 chg bounds, 98 chg sides, 141 chg coeffs, 20229 upgd conss, 5325493 impls, 338 clqs
4.29/4.39 c presolving (16 rounds):
4.29/4.39 c 19933 deleted vars, 71332 deleted constraints, 0 added constraints, 15451 tightened bounds, 0 added holes, 98 changed sides, 142 changed coefficients
4.29/4.39 c 5325493 implications, 341 cliques
4.29/4.39 c presolved problem has 7655 variables (7655 bin, 0 int, 0 impl, 0 cont) and 20229 constraints
4.29/4.39 c 393 constraints of type <knapsack>
4.29/4.39 c 16328 constraints of type <setppc>
4.29/4.39 c 3508 constraints of type <logicor>
4.29/4.39 c transformed objective value is always integral (scale: 1)
4.29/4.39 c Presolving Time: 3.83
4.29/4.39 c - non default parameters ----------------------------------------------------------------------
4.29/4.39 c # SCIP version 2.0.1.4
4.29/4.39 c
4.29/4.39 c # frequency for displaying node information lines
4.29/4.39 c # [type: int, range: [-1,2147483647], default: 100]
4.29/4.39 c display/freq = 10000
4.29/4.39 c
4.29/4.39 c # maximal time in seconds to run
4.29/4.39 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
4.29/4.39 c limits/time = 1797
4.29/4.39 c
4.29/4.39 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
4.29/4.39 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
4.29/4.39 c limits/memory = 13950
4.29/4.39 c
4.29/4.39 c # solving stops, if the given number of solutions were found (-1: no limit)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: -1]
4.29/4.39 c limits/solutions = 1
4.29/4.39 c
4.29/4.39 c # maximal number of separation rounds per node (-1: unlimited)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: 5]
4.29/4.39 c separating/maxrounds = 1
4.29/4.39 c
4.29/4.39 c # maximal number of separation rounds in the root node (-1: unlimited)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: -1]
4.29/4.39 c separating/maxroundsroot = 5
4.29/4.39 c
4.29/4.39 c # default clock type (1: CPU user seconds, 2: wall clock time)
4.29/4.39 c # [type: int, range: [1,2], default: 1]
4.29/4.39 c timing/clocktype = 2
4.29/4.39 c
4.29/4.39 c # belongs reading time to solving time?
4.29/4.39 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.29/4.39 c timing/reading = TRUE
4.29/4.39 c
4.29/4.39 c # should presolving try to simplify inequalities
4.29/4.39 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.29/4.39 c constraints/linear/simplifyinequalities = TRUE
4.29/4.39 c
4.29/4.39 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
4.29/4.39 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.29/4.39 c constraints/indicator/addCouplingCons = TRUE
4.29/4.39 c
4.29/4.39 c # should disaggregation of knapsack constraints be allowed in preprocessing?
4.29/4.39 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
4.29/4.39 c constraints/knapsack/disaggregation = FALSE
4.29/4.39 c
4.29/4.39 c # should presolving try to simplify knapsacks
4.29/4.39 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
4.29/4.39 c constraints/knapsack/simplifyinequalities = TRUE
4.29/4.39 c
4.29/4.39 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: -1]
4.29/4.39 c presolving/probing/maxrounds = 0
4.29/4.39 c
4.29/4.39 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: 10]
4.29/4.39 c heuristics/coefdiving/freq = -1
4.29/4.39 c
4.29/4.39 c # maximal fraction of diving LP iterations compared to node LP iterations
4.29/4.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.29/4.39 c heuristics/coefdiving/maxlpiterquot = 0.075
4.29/4.39 c
4.29/4.39 c # additional number of allowed LP iterations
4.29/4.39 c # [type: int, range: [0,2147483647], default: 1000]
4.29/4.39 c heuristics/coefdiving/maxlpiterofs = 1500
4.29/4.39 c
4.29/4.39 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: 30]
4.29/4.39 c heuristics/crossover/freq = -1
4.29/4.39 c
4.29/4.39 c # number of nodes added to the contingent of the total nodes
4.29/4.39 c # [type: longint, range: [0,9223372036854775807], default: 500]
4.29/4.39 c heuristics/crossover/nodesofs = 750
4.29/4.39 c
4.29/4.39 c # number of nodes without incumbent change that heuristic should wait
4.29/4.39 c # [type: longint, range: [0,9223372036854775807], default: 200]
4.29/4.39 c heuristics/crossover/nwaitingnodes = 100
4.29/4.39 c
4.29/4.39 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
4.29/4.39 c # [type: real, range: [0,1], default: 0.1]
4.29/4.39 c heuristics/crossover/nodesquot = 0.15
4.29/4.39 c
4.29/4.39 c # minimum percentage of integer variables that have to be fixed
4.29/4.39 c # [type: real, range: [0,1], default: 0.666]
4.29/4.39 c heuristics/crossover/minfixingrate = 0.5
4.29/4.39 c
4.29/4.39 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: 20]
4.29/4.39 c heuristics/feaspump/freq = -1
4.29/4.39 c
4.29/4.39 c # additional number of allowed LP iterations
4.29/4.39 c # [type: int, range: [0,2147483647], default: 1000]
4.29/4.39 c heuristics/feaspump/maxlpiterofs = 2000
4.29/4.39 c
4.29/4.39 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: 10]
4.29/4.39 c heuristics/fracdiving/freq = -1
4.29/4.39 c
4.29/4.39 c # maximal fraction of diving LP iterations compared to node LP iterations
4.29/4.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.29/4.39 c heuristics/fracdiving/maxlpiterquot = 0.075
4.29/4.39 c
4.29/4.39 c # additional number of allowed LP iterations
4.29/4.39 c # [type: int, range: [0,2147483647], default: 1000]
4.29/4.39 c heuristics/fracdiving/maxlpiterofs = 1500
4.29/4.39 c
4.29/4.39 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: 10]
4.29/4.39 c heuristics/guideddiving/freq = -1
4.29/4.39 c
4.29/4.39 c # maximal fraction of diving LP iterations compared to node LP iterations
4.29/4.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.29/4.39 c heuristics/guideddiving/maxlpiterquot = 0.075
4.29/4.39 c
4.29/4.39 c # additional number of allowed LP iterations
4.29/4.39 c # [type: int, range: [0,2147483647], default: 1000]
4.29/4.39 c heuristics/guideddiving/maxlpiterofs = 1500
4.29/4.39 c
4.29/4.39 c # maximal fraction of diving LP iterations compared to node LP iterations
4.29/4.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.29/4.39 c heuristics/intdiving/maxlpiterquot = 0.075
4.29/4.39 c
4.29/4.39 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: 10]
4.29/4.39 c heuristics/intshifting/freq = -1
4.29/4.39 c
4.29/4.39 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: 10]
4.29/4.39 c heuristics/linesearchdiving/freq = -1
4.29/4.39 c
4.29/4.39 c # maximal fraction of diving LP iterations compared to node LP iterations
4.29/4.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.29/4.39 c heuristics/linesearchdiving/maxlpiterquot = 0.075
4.29/4.39 c
4.29/4.39 c # additional number of allowed LP iterations
4.29/4.39 c # [type: int, range: [0,2147483647], default: 1000]
4.29/4.39 c heuristics/linesearchdiving/maxlpiterofs = 1500
4.29/4.39 c
4.29/4.39 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: 20]
4.29/4.39 c heuristics/objpscostdiving/freq = -1
4.29/4.39 c
4.29/4.39 c # maximal fraction of diving LP iterations compared to total iteration number
4.29/4.39 c # [type: real, range: [0,1], default: 0.01]
4.29/4.39 c heuristics/objpscostdiving/maxlpiterquot = 0.015
4.29/4.39 c
4.29/4.39 c # additional number of allowed LP iterations
4.29/4.39 c # [type: int, range: [0,2147483647], default: 1000]
4.29/4.39 c heuristics/objpscostdiving/maxlpiterofs = 1500
4.29/4.39 c
4.29/4.39 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: 1]
4.29/4.39 c heuristics/oneopt/freq = -1
4.29/4.39 c
4.29/4.39 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: 10]
4.29/4.39 c heuristics/pscostdiving/freq = -1
4.29/4.39 c
4.29/4.39 c # maximal fraction of diving LP iterations compared to node LP iterations
4.29/4.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.29/4.39 c heuristics/pscostdiving/maxlpiterquot = 0.075
4.29/4.39 c
4.29/4.39 c # additional number of allowed LP iterations
4.29/4.39 c # [type: int, range: [0,2147483647], default: 1000]
4.29/4.39 c heuristics/pscostdiving/maxlpiterofs = 1500
4.29/4.39 c
4.29/4.39 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: 0]
4.29/4.39 c heuristics/rens/freq = -1
4.29/4.39 c
4.29/4.39 c # minimum percentage of integer variables that have to be fixable
4.29/4.39 c # [type: real, range: [0,1], default: 0.5]
4.29/4.39 c heuristics/rens/minfixingrate = 0.3
4.29/4.39 c
4.29/4.39 c # number of nodes added to the contingent of the total nodes
4.29/4.39 c # [type: longint, range: [0,9223372036854775807], default: 500]
4.29/4.39 c heuristics/rens/nodesofs = 2000
4.29/4.39 c
4.29/4.39 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: 20]
4.29/4.39 c heuristics/rootsoldiving/freq = -1
4.29/4.39 c
4.29/4.39 c # maximal fraction of diving LP iterations compared to node LP iterations
4.29/4.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
4.29/4.39 c heuristics/rootsoldiving/maxlpiterquot = 0.015
4.29/4.39 c
4.29/4.39 c # additional number of allowed LP iterations
4.29/4.39 c # [type: int, range: [0,2147483647], default: 1000]
4.29/4.39 c heuristics/rootsoldiving/maxlpiterofs = 1500
4.29/4.39 c
4.29/4.39 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: 1]
4.29/4.39 c heuristics/rounding/freq = -1
4.29/4.39 c
4.29/4.39 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: 0]
4.29/4.39 c heuristics/shiftandpropagate/freq = -1
4.29/4.39 c
4.29/4.39 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: 10]
4.29/4.39 c heuristics/shifting/freq = -1
4.29/4.39 c
4.29/4.39 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: 1]
4.29/4.39 c heuristics/simplerounding/freq = -1
4.29/4.39 c
4.29/4.39 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: 1]
4.29/4.39 c heuristics/subnlp/freq = -1
4.29/4.39 c
4.29/4.39 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: 0]
4.29/4.39 c heuristics/trivial/freq = -1
4.29/4.39 c
4.29/4.39 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: 1]
4.29/4.39 c heuristics/trysol/freq = -1
4.29/4.39 c
4.29/4.39 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: 0]
4.29/4.39 c heuristics/undercover/freq = -1
4.29/4.39 c
4.29/4.39 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: 10]
4.29/4.39 c heuristics/veclendiving/freq = -1
4.29/4.39 c
4.29/4.39 c # maximal fraction of diving LP iterations compared to node LP iterations
4.29/4.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
4.29/4.39 c heuristics/veclendiving/maxlpiterquot = 0.075
4.29/4.39 c
4.29/4.39 c # additional number of allowed LP iterations
4.29/4.39 c # [type: int, range: [0,2147483647], default: 1000]
4.29/4.39 c heuristics/veclendiving/maxlpiterofs = 1500
4.29/4.39 c
4.29/4.39 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: 1]
4.29/4.39 c heuristics/zirounding/freq = -1
4.29/4.39 c
4.29/4.39 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: 0]
4.29/4.39 c separating/cmir/freq = -1
4.29/4.39 c
4.29/4.39 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: 0]
4.29/4.39 c separating/flowcover/freq = -1
4.29/4.39 c
4.29/4.39 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
4.29/4.39 c # [type: int, range: [-1,2147483647], default: -1]
4.29/4.39 c separating/rapidlearning/freq = 0
4.29/4.39 c
4.29/4.39 c -----------------------------------------------------------------------------------------------
4.29/4.39 c start solving
4.29/4.40 c
29.99/30.02 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
29.99/30.02 c 30.0s| 1 | 0 | 22354 | - | 134M| 0 | - |7655 | 20k|7655 | 20k| 0 | 0 | 0 | cutoff | -- | 0.00%
29.99/30.02 c 30.0s| 1 | 0 | 22354 | - | 134M| 0 | - |7655 | 20k|7655 | 20k| 0 | 0 | 0 | cutoff | -- | 0.00%
29.99/30.02 c
29.99/30.02 c SCIP Status : problem is solved [infeasible]
29.99/30.02 c Solving Time (sec) : 30.02
29.99/30.02 c Solving Nodes : 1
29.99/30.02 c Primal Bound : +1.00000000000000e+20 (0 solutions)
29.99/30.02 c Dual Bound : +1.00000000000000e+20
29.99/30.02 c Gap : 0.00 %
29.99/30.02 s UNSATISFIABLE
29.99/30.02 c SCIP Status : problem is solved [infeasible]
29.99/30.02 c Total Time : 30.02
29.99/30.02 c solving : 30.02
29.99/30.02 c presolving : 3.83 (included in solving)
29.99/30.02 c reading : 0.48 (included in solving)
29.99/30.02 c Original Problem :
29.99/30.02 c Problem name : HOME/instance-3486149-1307791684.opb
29.99/30.02 c Variables : 27588 (27588 binary, 0 integer, 0 implicit integer, 0 continuous)
29.99/30.02 c Constraints : 91561 initial, 91561 maximal
29.99/30.02 c Presolved Problem :
29.99/30.02 c Problem name : t_HOME/instance-3486149-1307791684.opb
29.99/30.02 c Variables : 7655 (7655 binary, 0 integer, 0 implicit integer, 0 continuous)
29.99/30.02 c Constraints : 20229 initial, 20229 maximal
29.99/30.02 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
29.99/30.02 c trivial : 0.01 878 0 0 0 0 0 0 0 0
29.99/30.02 c dualfix : 0.01 105 0 0 0 0 0 0 0 0
29.99/30.02 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
29.99/30.02 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
29.99/30.02 c implics : 0.05 0 0 0 0 0 0 0 0 0
29.99/30.02 c probing : 0.00 0 0 0 0 0 0 0 0 0
29.99/30.02 c knapsack : 0.05 0 0 0 0 0 0 0 11 61
29.99/30.02 c setppc : 0.03 0 0 0 0 0 0 0 0 0
29.99/30.02 c linear : 3.38 14573 4377 0 15451 0 71332 0 87 81
29.99/30.02 c logicor : 0.02 0 0 0 0 0 0 0 0 0
29.99/30.02 c root node : - 0 - - 0 - - - - -
29.99/30.02 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
29.99/30.02 c integral : 0 0 0 0 0 0 0 0 0 0 0 0
29.99/30.02 c knapsack : 393 0 1 0 0 0 0 0 0 0 0 0
29.99/30.02 c setppc : 16328 0 1 0 0 0 0 0 0 0 0 0
29.99/30.02 c logicor : 3508 0 1 0 0 0 0 0 0 0 0 0
29.99/30.02 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
29.99/30.02 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
29.99/30.02 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
29.99/30.02 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
29.99/30.02 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
29.99/30.02 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
29.99/30.02 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
29.99/30.02 c Propagators : #Propagate #Resprop Cutoffs DomReds
29.99/30.02 c vbounds : 0 0 0 0
29.99/30.02 c rootredcost : 0 0 0 0
29.99/30.02 c pseudoobj : 0 0 0 0
29.99/30.02 c Propagator Timings : TotalTime Propagate Resprop
29.99/30.02 c vbounds : 0.00 0.00 0.00
29.99/30.02 c rootredcost : 0.00 0.00 0.00
29.99/30.02 c pseudoobj : 0.00 0.00 0.00
29.99/30.02 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
29.99/30.02 c propagation : 0.00 0 0 0 0.0 0 0.0 -
29.99/30.02 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
29.99/30.02 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
29.99/30.02 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
29.99/30.02 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
29.99/30.02 c applied globally : - - - 0 0.0 - - -
29.99/30.02 c applied locally : - - - 0 0.0 - - -
29.99/30.02 c Separators : Time Calls Cutoffs DomReds Cuts Conss
29.99/30.02 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
29.99/30.02 c redcost : 0.00 0 0 0 0 0
29.99/30.02 c impliedbounds : 0.00 0 0 0 0 0
29.99/30.02 c intobj : 0.00 0 0 0 0 0
29.99/30.02 c gomory : 0.00 0 0 0 0 0
29.99/30.02 c cgmip : 0.00 0 0 0 0 0
29.99/30.02 c closecuts : 0.00 0 0 0 0 0
29.99/30.02 c strongcg : 0.00 0 0 0 0 0
29.99/30.02 c cmir : 0.00 0 0 0 0 0
29.99/30.02 c flowcover : 0.00 0 0 0 0 0
29.99/30.02 c clique : 0.00 0 0 0 0 0
29.99/30.02 c zerohalf : 0.00 0 0 0 0 0
29.99/30.02 c mcf : 0.00 0 0 0 0 0
29.99/30.02 c oddcycle : 0.00 0 0 0 0 0
29.99/30.02 c rapidlearning : 0.00 0 0 0 0 0
29.99/30.02 c Pricers : Time Calls Vars
29.99/30.02 c problem variables: 0.00 0 0
29.99/30.02 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
29.99/30.02 c pscost : 0.00 0 0 0 0 0 0
29.99/30.02 c inference : 0.00 0 0 0 0 0 0
29.99/30.02 c mostinf : 0.00 0 0 0 0 0 0
29.99/30.02 c leastinf : 0.00 0 0 0 0 0 0
29.99/30.02 c fullstrong : 0.00 0 0 0 0 0 0
29.99/30.02 c allfullstrong : 0.00 0 0 0 0 0 0
29.99/30.02 c random : 0.00 0 0 0 0 0 0
29.99/30.02 c relpscost : 0.00 0 0 0 0 0 0
29.99/30.02 c Primal Heuristics : Time Calls Found
29.99/30.02 c LP solutions : 0.00 - 0
29.99/30.02 c pseudo solutions : 0.00 - 0
29.99/30.02 c trivial : 0.02 1 0
29.99/30.02 c shiftandpropagate: 0.00 0 0
29.99/30.02 c simplerounding : 0.00 0 0
29.99/30.02 c zirounding : 0.00 0 0
29.99/30.02 c rounding : 0.00 0 0
29.99/30.02 c shifting : 0.00 0 0
29.99/30.02 c intshifting : 0.00 0 0
29.99/30.02 c oneopt : 0.00 0 0
29.99/30.02 c twoopt : 0.00 0 0
29.99/30.02 c fixandinfer : 0.00 0 0
29.99/30.02 c feaspump : 0.00 0 0
29.99/30.02 c clique : 0.00 0 0
29.99/30.02 c coefdiving : 0.00 0 0
29.99/30.02 c pscostdiving : 0.00 0 0
29.99/30.02 c fracdiving : 0.00 0 0
29.99/30.02 c veclendiving : 0.00 0 0
29.99/30.02 c intdiving : 0.00 0 0
29.99/30.02 c actconsdiving : 0.00 0 0
29.99/30.02 c objpscostdiving : 0.00 0 0
29.99/30.02 c rootsoldiving : 0.00 0 0
29.99/30.02 c linesearchdiving : 0.00 0 0
29.99/30.02 c guideddiving : 0.00 0 0
29.99/30.02 c octane : 0.00 0 0
29.99/30.02 c rens : 0.00 0 0
29.99/30.02 c rins : 0.00 0 0
29.99/30.02 c localbranching : 0.00 0 0
29.99/30.02 c mutation : 0.00 0 0
29.99/30.02 c crossover : 0.00 0 0
29.99/30.02 c dins : 0.00 0 0
29.99/30.02 c vbounds : 0.00 0 0
29.99/30.02 c undercover : 0.00 0 0
29.99/30.02 c subnlp : 0.00 0 0
29.99/30.02 c trysol : 0.00 0 0
29.99/30.02 c LP : Time Calls Iterations Iter/call Iter/sec
29.99/30.02 c primal LP : 0.00 0 0 0.00 -
29.99/30.02 c dual LP : 25.58 1 22354 22354.00 874.04
29.99/30.02 c lex dual LP : 0.00 0 0 0.00 -
29.99/30.02 c barrier LP : 0.00 0 0 0.00 -
29.99/30.02 c diving/probing LP: 0.00 0 0 0.00 -
29.99/30.02 c strong branching : 0.00 0 0 0.00 -
29.99/30.02 c (at root node) : - 0 0 0.00 -
29.99/30.02 c conflict analysis: 0.00 0 0 0.00 -
29.99/30.02 c B&B Tree :
29.99/30.02 c number of runs : 1
29.99/30.02 c nodes : 1
29.99/30.02 c nodes (total) : 1
29.99/30.02 c nodes left : 0
29.99/30.02 c max depth : 0
29.99/30.02 c max depth (total): 0
29.99/30.02 c backtracks : 0 (0.0%)
29.99/30.02 c delayed cutoffs : 0
29.99/30.02 c repropagations : 0 (0 domain reductions, 0 cutoffs)
29.99/30.02 c avg switch length: 2.00
29.99/30.02 c switching time : 0.00
29.99/30.02 c Solution :
29.99/30.02 c Solutions found : 0 (0 improvements)
29.99/30.02 c Primal Bound : infeasible
29.99/30.02 c Dual Bound : -
29.99/30.02 c Gap : 0.00 %
29.99/30.02 c Root Dual Bound : -
29.99/30.02 c Root Iterations : 22354
30.09/30.14 c Time complete: 30.13.