0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: a3bf3a4-dirty]
0.00/0.00 c Copyright (c) 2002-2012 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-3690554-1338022606.opb>
0.01/0.03 c original problem has 3968 variables (3968 bin, 0 int, 0 impl, 0 cont) and 13430 constraints
0.01/0.03 c problem read in 0.04
0.01/0.04 c No objective function, only one solution is needed.
0.01/0.04 c presolving settings loaded
0.01/0.08 c presolving:
0.29/0.34 c (round 1) 1414 del vars, 3678 del conss, 0 add conss, 1043 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 598348 impls, 0 clqs
0.39/0.45 c (round 2) 2752 del vars, 8895 del conss, 0 add conss, 2237 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 606296 impls, 0 clqs
0.39/0.47 c (round 3) 3070 del vars, 10632 del conss, 0 add conss, 2401 chg bounds, 56 chg sides, 49 chg coeffs, 0 upgd conss, 608748 impls, 0 clqs
0.39/0.49 c (round 4) 3276 del vars, 11219 del conss, 0 add conss, 2524 chg bounds, 75 chg sides, 68 chg coeffs, 0 upgd conss, 611604 impls, 0 clqs
0.39/0.49 c (round 5) 3402 del vars, 11758 del conss, 0 add conss, 2607 chg bounds, 79 chg sides, 72 chg coeffs, 0 upgd conss, 613169 impls, 0 clqs
0.49/0.50 c (round 6) 3478 del vars, 11993 del conss, 0 add conss, 2664 chg bounds, 98 chg sides, 90 chg coeffs, 0 upgd conss, 613593 impls, 0 clqs
0.49/0.50 c (round 7) 3499 del vars, 12084 del conss, 0 add conss, 2669 chg bounds, 110 chg sides, 102 chg coeffs, 0 upgd conss, 613781 impls, 0 clqs
0.49/0.50 c (round 8) 3499 del vars, 12110 del conss, 0 add conss, 2669 chg bounds, 110 chg sides, 102 chg coeffs, 0 upgd conss, 613781 impls, 0 clqs
0.49/0.52 c (round 9) 3499 del vars, 12110 del conss, 0 add conss, 2669 chg bounds, 110 chg sides, 102 chg coeffs, 1325 upgd conss, 613781 impls, 0 clqs
0.49/0.53 c (round 10) 3499 del vars, 12113 del conss, 0 add conss, 2669 chg bounds, 153 chg sides, 316 chg coeffs, 1325 upgd conss, 614581 impls, 66 clqs
0.49/0.53 c (round 11) 3499 del vars, 12114 del conss, 0 add conss, 2669 chg bounds, 168 chg sides, 459 chg coeffs, 1325 upgd conss, 614673 impls, 83 clqs
0.49/0.54 c (round 12) 3499 del vars, 12115 del conss, 0 add conss, 2669 chg bounds, 170 chg sides, 510 chg coeffs, 1325 upgd conss, 614701 impls, 99 clqs
0.49/0.54 c (round 13) 3499 del vars, 12115 del conss, 0 add conss, 2669 chg bounds, 172 chg sides, 539 chg coeffs, 1325 upgd conss, 614729 impls, 111 clqs
0.49/0.55 c (round 14) 3499 del vars, 12115 del conss, 0 add conss, 2669 chg bounds, 172 chg sides, 545 chg coeffs, 1325 upgd conss, 614729 impls, 113 clqs
0.49/0.55 c (round 15) 3499 del vars, 12115 del conss, 0 add conss, 2669 chg bounds, 172 chg sides, 546 chg coeffs, 1325 upgd conss, 614729 impls, 113 clqs
0.49/0.55 c (round 16) 3499 del vars, 12671 del conss, 171 add conss, 2669 chg bounds, 172 chg sides, 546 chg coeffs, 1325 upgd conss, 614729 impls, 113 clqs
0.49/0.56 c (round 17) 3499 del vars, 12799 del conss, 299 add conss, 2669 chg bounds, 172 chg sides, 546 chg coeffs, 1325 upgd conss, 614729 impls, 155 clqs
0.49/0.57 c presolving (18 rounds):
0.49/0.57 c 3499 deleted vars, 12799 deleted constraints, 299 added constraints, 2669 tightened bounds, 0 added holes, 172 changed sides, 546 changed coefficients
0.49/0.57 c 614729 implications, 283 cliques
0.49/0.57 c presolved problem has 469 variables (469 bin, 0 int, 0 impl, 0 cont) and 930 constraints
0.49/0.57 c 190 constraints of type <knapsack>
0.49/0.57 c 738 constraints of type <setppc>
0.49/0.57 c 2 constraints of type <logicor>
0.49/0.57 c transformed objective value is always integral (scale: 1)
0.49/0.57 c Presolving Time: 0.51
0.49/0.57 c - non default parameters ----------------------------------------------------------------------
0.49/0.57 c # SCIP version 2.1.1.4
0.49/0.57 c
0.49/0.57 c # maximal time in seconds to run
0.49/0.57 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.49/0.57 c limits/time = 1797
0.49/0.57 c
0.49/0.57 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.49/0.57 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.49/0.57 c limits/memory = 13950
0.49/0.57 c
0.49/0.57 c # solving stops, if the given number of solutions were found (-1: no limit)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.57 c limits/solutions = 1
0.49/0.57 c
0.49/0.57 c # maximal number of separation rounds per node (-1: unlimited)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: 5]
0.49/0.57 c separating/maxrounds = 1
0.49/0.57 c
0.49/0.57 c # maximal number of separation rounds in the root node (-1: unlimited)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.57 c separating/maxroundsroot = 5
0.49/0.57 c
0.49/0.57 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.49/0.57 c # [type: int, range: [1,2], default: 1]
0.49/0.57 c timing/clocktype = 2
0.49/0.57 c
0.49/0.57 c # belongs reading time to solving time?
0.49/0.57 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.49/0.57 c timing/reading = TRUE
0.49/0.57 c
0.49/0.57 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.49/0.57 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.49/0.57 c constraints/knapsack/disaggregation = FALSE
0.49/0.57 c
0.49/0.57 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.57 c heuristics/coefdiving/freq = -1
0.49/0.57 c
0.49/0.57 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.57 c heuristics/coefdiving/maxlpiterquot = 0.075
0.49/0.57 c
0.49/0.57 c # additional number of allowed LP iterations
0.49/0.57 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.57 c heuristics/coefdiving/maxlpiterofs = 1500
0.49/0.57 c
0.49/0.57 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: 30]
0.49/0.57 c heuristics/crossover/freq = -1
0.49/0.57 c
0.49/0.57 c # number of nodes added to the contingent of the total nodes
0.49/0.57 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.49/0.57 c heuristics/crossover/nodesofs = 750
0.49/0.57 c
0.49/0.57 c # number of nodes without incumbent change that heuristic should wait
0.49/0.57 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.49/0.57 c heuristics/crossover/nwaitingnodes = 100
0.49/0.57 c
0.49/0.57 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.49/0.57 c # [type: real, range: [0,1], default: 0.1]
0.49/0.57 c heuristics/crossover/nodesquot = 0.15
0.49/0.57 c
0.49/0.57 c # minimum percentage of integer variables that have to be fixed
0.49/0.57 c # [type: real, range: [0,1], default: 0.666]
0.49/0.57 c heuristics/crossover/minfixingrate = 0.5
0.49/0.57 c
0.49/0.57 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.57 c heuristics/feaspump/freq = -1
0.49/0.57 c
0.49/0.57 c # additional number of allowed LP iterations
0.49/0.57 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.57 c heuristics/feaspump/maxlpiterofs = 2000
0.49/0.57 c
0.49/0.57 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.57 c heuristics/fracdiving/freq = -1
0.49/0.57 c
0.49/0.57 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.57 c heuristics/fracdiving/maxlpiterquot = 0.075
0.49/0.57 c
0.49/0.57 c # additional number of allowed LP iterations
0.49/0.57 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.57 c heuristics/fracdiving/maxlpiterofs = 1500
0.49/0.57 c
0.49/0.57 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.57 c heuristics/guideddiving/freq = -1
0.49/0.57 c
0.49/0.57 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.57 c heuristics/guideddiving/maxlpiterquot = 0.075
0.49/0.57 c
0.49/0.57 c # additional number of allowed LP iterations
0.49/0.57 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.57 c heuristics/guideddiving/maxlpiterofs = 1500
0.49/0.57 c
0.49/0.57 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.57 c heuristics/intdiving/maxlpiterquot = 0.075
0.49/0.57 c
0.49/0.57 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.57 c heuristics/intshifting/freq = -1
0.49/0.57 c
0.49/0.57 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.57 c heuristics/linesearchdiving/freq = -1
0.49/0.57 c
0.49/0.57 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.57 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.49/0.57 c
0.49/0.57 c # additional number of allowed LP iterations
0.49/0.57 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.57 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.49/0.57 c
0.49/0.57 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.57 c heuristics/objpscostdiving/freq = -1
0.49/0.57 c
0.49/0.57 c # maximal fraction of diving LP iterations compared to total iteration number
0.49/0.57 c # [type: real, range: [0,1], default: 0.01]
0.49/0.57 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.49/0.57 c
0.49/0.57 c # additional number of allowed LP iterations
0.49/0.57 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.57 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.49/0.57 c
0.49/0.57 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.57 c heuristics/oneopt/freq = -1
0.49/0.57 c
0.49/0.57 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.57 c heuristics/pscostdiving/freq = -1
0.49/0.57 c
0.49/0.57 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.57 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.49/0.57 c
0.49/0.57 c # additional number of allowed LP iterations
0.49/0.57 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.57 c heuristics/pscostdiving/maxlpiterofs = 1500
0.49/0.57 c
0.49/0.57 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.57 c heuristics/rens/freq = -1
0.49/0.57 c
0.49/0.57 c # minimum percentage of integer variables that have to be fixable
0.49/0.57 c # [type: real, range: [0,1], default: 0.5]
0.49/0.57 c heuristics/rens/minfixingrate = 0.3
0.49/0.57 c
0.49/0.57 c # number of nodes added to the contingent of the total nodes
0.49/0.57 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.49/0.57 c heuristics/rens/nodesofs = 2000
0.49/0.57 c
0.49/0.57 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.57 c heuristics/rootsoldiving/freq = -1
0.49/0.57 c
0.49/0.57 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.49/0.57 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.49/0.57 c
0.49/0.57 c # additional number of allowed LP iterations
0.49/0.57 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.57 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.49/0.57 c
0.49/0.57 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.57 c heuristics/rounding/freq = -1
0.49/0.57 c
0.49/0.57 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.57 c heuristics/shiftandpropagate/freq = -1
0.49/0.57 c
0.49/0.57 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.57 c heuristics/shifting/freq = -1
0.49/0.57 c
0.49/0.57 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.57 c heuristics/simplerounding/freq = -1
0.49/0.57 c
0.49/0.57 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.57 c heuristics/subnlp/freq = -1
0.49/0.57 c
0.49/0.57 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.57 c heuristics/trivial/freq = -1
0.49/0.57 c
0.49/0.57 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.57 c heuristics/trysol/freq = -1
0.49/0.57 c
0.49/0.57 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.57 c heuristics/undercover/freq = -1
0.49/0.57 c
0.49/0.57 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.57 c heuristics/veclendiving/freq = -1
0.49/0.57 c
0.49/0.57 c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.57 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.57 c heuristics/veclendiving/maxlpiterquot = 0.075
0.49/0.57 c
0.49/0.57 c # additional number of allowed LP iterations
0.49/0.57 c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.57 c heuristics/veclendiving/maxlpiterofs = 1500
0.49/0.57 c
0.49/0.57 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.57 c heuristics/zirounding/freq = -1
0.49/0.57 c
0.49/0.57 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.57 c propagating/probing/maxprerounds = 0
0.49/0.57 c
0.49/0.57 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.57 c separating/cmir/freq = -1
0.49/0.57 c
0.49/0.57 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.57 c separating/flowcover/freq = -1
0.49/0.57 c
0.49/0.57 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.57 c separating/rapidlearning/freq = 0
0.49/0.57 c
0.49/0.57 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
0.49/0.57 c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.57 c heuristics/indoneopt/freq = -1
0.49/0.57 c
0.49/0.57 c -----------------------------------------------------------------------------------------------
0.49/0.57 c start solving
0.49/0.57 c
0.49/0.58 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.58 c 0.6s| 1 | 0 | 234 | - | 14M| 0 | 166 | 469 | 930 | 469 | 930 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.70 c 0.7s| 1 | 0 | 322 | - | 14M| 0 | - | 469 | 941 | 469 | 930 | 0 | 0 | 0 | cutoff | -- | 0.00%
0.69/0.70 c 0.7s| 1 | 0 | 322 | - | 14M| 0 | - | 469 | 941 | 469 | 930 | 0 | 0 | 0 | cutoff | -- | 0.00%
0.69/0.70 c
0.69/0.70 c SCIP Status : problem is solved [infeasible]
0.69/0.70 c Solving Time (sec) : 0.70
0.69/0.70 c Solving Nodes : 1
0.69/0.70 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.69/0.70 c Dual Bound : +1.00000000000000e+20
0.69/0.70 c Gap : 0.00 %
0.69/0.70 s UNSATISFIABLE
0.69/0.70 c SCIP Status : problem is solved [infeasible]
0.69/0.70 c Total Time : 0.70
0.69/0.70 c solving : 0.70
0.69/0.70 c presolving : 0.51 (included in solving)
0.69/0.70 c reading : 0.04 (included in solving)
0.69/0.70 c copying : 0.01 (1 #copies) (minimal 0.01, maximal 0.01, average 0.01)
0.69/0.70 c Original Problem :
0.69/0.70 c Problem name : HOME/instance-3690554-1338022606.opb
0.69/0.70 c Variables : 3968 (3968 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.70 c Constraints : 13430 initial, 13430 maximal
0.69/0.70 c Objective sense : minimize
0.69/0.70 c Presolved Problem :
0.69/0.70 c Problem name : t_HOME/instance-3690554-1338022606.opb
0.69/0.70 c Variables : 469 (469 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.70 c Constraints : 930 initial, 941 maximal
0.69/0.70 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.69/0.70 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.70 c trivial : 0.00 0.00 124 0 0 0 0 0 0 0 0
0.69/0.70 c dualfix : 0.00 0.00 28 0 0 0 0 0 0 0 0
0.69/0.70 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.70 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.70 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.70 c gateextraction : 0.00 0.00 0 0 0 0 0 556 171 0 0
0.69/0.70 c implics : 0.00 0.00 0 23 0 0 0 0 0 0 0
0.69/0.70 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.70 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.70 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.70 c knapsack : 0.02 0.00 0 0 0 0 0 2 0 62 444
0.69/0.70 c setppc : 0.02 0.00 0 0 0 0 0 3 0 0 0
0.69/0.70 c and : 0.00 0.00 0 0 0 0 0 128 128 0 0
0.69/0.70 c linear : 0.41 0.00 2545 779 0 2669 0 12110 0 110 102
0.69/0.70 c logicor : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.69/0.70 c root node : - - 143 - - 143 - - - - -
0.69/0.70 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.69/0.70 c integral : 0 0 0 0 0 0 1 0 0 0 0 0 0
0.69/0.70 c knapsack : 190 190 1 1 0 0 0 0 0 0 128 0 0
0.69/0.70 c setppc : 738 738 1 1 0 0 0 0 0 0 0 0 0
0.69/0.70 c linear : 0+ 11 0 0 0 0 0 0 0 0 0 0 0
0.69/0.70 c logicor : 2 2 1 1 0 0 0 0 0 0 0 0 0
0.69/0.70 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0
0.69/0.70 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.69/0.70 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.70 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.70 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.70 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.70 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.70 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.69/0.70 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.69/0.70 c rootredcost : 0 0 0 0
0.69/0.70 c pseudoobj : 0 0 0 0
0.69/0.70 c vbounds : 0 0 0 0
0.69/0.70 c redcost : 1 0 0 0
0.69/0.70 c probing : 0 0 0 0
0.69/0.70 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.69/0.70 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.69/0.70 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.69/0.70 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.69/0.70 c redcost : 0.00 0.00 0.00 0.00 0.00
0.69/0.70 c probing : 0.00 0.00 0.00 0.00 0.00
0.69/0.70 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.69/0.70 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.70 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.70 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.70 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.70 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.70 c applied globally : - - - 0 0.0 - - -
0.69/0.70 c applied locally : - - - 0 0.0 - - -
0.69/0.70 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.69/0.70 c cut pool : 0.00 0 - - 0 - (maximal pool size: 238)
0.69/0.70 c closecuts : 0.00 0.00 0 0 0 0 0
0.69/0.70 c impliedbounds : 0.00 0.00 1 0 0 12 0
0.69/0.70 c intobj : 0.00 0.00 0 0 0 0 0
0.69/0.70 c gomory : 0.01 0.00 1 0 0 50 0
0.69/0.70 c cgmip : 0.00 0.00 0 0 0 0 0
0.69/0.70 c strongcg : 0.03 0.00 1 0 0 477 0
0.69/0.70 c cmir : 0.00 0.00 0 0 0 0 0
0.69/0.70 c flowcover : 0.00 0.00 0 0 0 0 0
0.69/0.70 c clique : 0.01 0.00 1 0 0 7 0
0.69/0.70 c zerohalf : 0.00 0.00 0 0 0 0 0
0.69/0.70 c mcf : 0.00 0.00 1 0 0 0 0
0.69/0.70 c oddcycle : 0.00 0.00 0 0 0 0 0
0.69/0.70 c rapidlearning : 0.06 0.00 1 0 143 0 11
0.69/0.70 c Pricers : ExecTime SetupTime Calls Vars
0.69/0.70 c problem variables: 0.00 - 0 0
0.69/0.70 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.69/0.70 c pscost : 0.00 0.00 0 0 0 0 0 0
0.69/0.70 c inference : 0.00 0.00 0 0 0 0 0 0
0.69/0.70 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.69/0.70 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.69/0.70 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.69/0.70 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.69/0.70 c random : 0.00 0.00 0 0 0 0 0 0
0.69/0.70 c relpscost : 0.00 0.00 0 0 0 0 0 0
0.69/0.70 c Primal Heuristics : ExecTime SetupTime Calls Found
0.69/0.70 c LP solutions : 0.00 - - 0
0.69/0.70 c pseudo solutions : 0.00 - - 0
0.69/0.70 c smallcard : 0.00 0.00 0 0
0.69/0.70 c trivial : 0.00 0.00 1 0
0.69/0.70 c shiftandpropagate: 0.00 0.00 0 0
0.69/0.70 c simplerounding : 0.00 0.00 0 0
0.69/0.70 c zirounding : 0.00 0.00 0 0
0.69/0.70 c rounding : 0.00 0.00 0 0
0.69/0.70 c shifting : 0.00 0.00 0 0
0.69/0.70 c intshifting : 0.00 0.00 0 0
0.69/0.70 c oneopt : 0.00 0.00 0 0
0.69/0.70 c twoopt : 0.00 0.00 0 0
0.69/0.70 c indtwoopt : 0.00 0.00 0 0
0.69/0.70 c indoneopt : 0.00 0.00 0 0
0.69/0.70 c fixandinfer : 0.00 0.00 0 0
0.69/0.70 c feaspump : 0.00 0.00 0 0
0.69/0.70 c clique : 0.00 0.00 0 0
0.69/0.70 c indrounding : 0.00 0.00 0 0
0.69/0.70 c indcoefdiving : 0.00 0.00 0 0
0.69/0.70 c coefdiving : 0.00 0.00 0 0
0.69/0.70 c pscostdiving : 0.00 0.00 0 0
0.69/0.70 c nlpdiving : 0.00 0.00 0 0
0.69/0.70 c fracdiving : 0.00 0.00 0 0
0.69/0.70 c veclendiving : 0.00 0.00 0 0
0.69/0.70 c intdiving : 0.00 0.00 0 0
0.69/0.70 c actconsdiving : 0.00 0.00 0 0
0.69/0.70 c objpscostdiving : 0.00 0.00 0 0
0.69/0.70 c rootsoldiving : 0.00 0.00 0 0
0.69/0.70 c linesearchdiving : 0.00 0.00 0 0
0.69/0.70 c guideddiving : 0.00 0.00 0 0
0.69/0.70 c octane : 0.00 0.00 0 0
0.69/0.70 c rens : 0.00 0.00 0 0
0.69/0.70 c rins : 0.00 0.00 0 0
0.69/0.70 c localbranching : 0.00 0.00 0 0
0.69/0.70 c mutation : 0.00 0.00 0 0
0.69/0.70 c crossover : 0.00 0.00 0 0
0.69/0.70 c dins : 0.00 0.00 0 0
0.69/0.70 c vbounds : 0.00 0.00 0 0
0.69/0.70 c undercover : 0.00 0.00 0 0
0.69/0.70 c subnlp : 0.00 0.00 0 0
0.69/0.70 c trysol : 0.00 0.00 0 0
0.69/0.70 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.69/0.70 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.69/0.70 c dual LP : 0.02 2 322 161.00 21251.32 0.00 0
0.69/0.70 c lex dual LP : 0.00 0 0 0.00 -
0.69/0.70 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.69/0.70 c diving/probing LP: 0.00 0 0 0.00 -
0.69/0.70 c strong branching : 0.00 0 0 0.00 -
0.69/0.70 c (at root node) : - 0 0 0.00 -
0.69/0.70 c conflict analysis: 0.00 0 0 0.00 -
0.69/0.70 c B&B Tree :
0.69/0.70 c number of runs : 1
0.69/0.70 c nodes : 1
0.69/0.70 c nodes (total) : 1
0.69/0.70 c nodes left : 0
0.69/0.70 c max depth : 0
0.69/0.70 c max depth (total): 0
0.69/0.70 c backtracks : 0 (0.0%)
0.69/0.70 c delayed cutoffs : 0
0.69/0.70 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.69/0.70 c avg switch length: 2.00
0.69/0.70 c switching time : 0.00
0.69/0.70 c Solution :
0.69/0.70 c Solutions found : 0 (0 improvements)
0.69/0.70 c Primal Bound : infeasible
0.69/0.70 c Dual Bound : -
0.69/0.70 c Gap : 0.00 %
0.69/0.70 c Root Dual Bound : -
0.69/0.70 c Root Iterations : 322
0.69/0.72 c Time complete: 0.71.