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-1870719-1245216871.opb>
0.00/0.01 c original problem has 714 variables (714 bin, 0 int, 0 impl, 0 cont) and 766 constraints
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c start presolving problem
0.00/0.02 c presolving:
0.09/0.14 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 5012 impls, 100 clqs
0.09/0.14 c presolving (2 rounds):
0.09/0.14 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.14 c 5012 implications, 100 cliques
0.09/0.14 c presolved problem has 714 variables (714 bin, 0 int, 0 impl, 0 cont) and 766 constraints
0.09/0.14 c 1 constraints of type <knapsack>
0.09/0.14 c 100 constraints of type <setppc>
0.09/0.14 c 614 constraints of type <and>
0.09/0.14 c 1 constraints of type <linear>
0.09/0.14 c 50 constraints of type <logicor>
0.09/0.14 c transformed objective value is always integral (scale: 1)
0.09/0.14 c Presolving Time: 0.05
0.09/0.14 c SATUNSAT-NLC
0.09/0.14 c -----------------------------------------------------------------------------------------------
0.09/0.14 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.14 c separating/flowcover/freq = c -1
0.09/0.14 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.14 c separating/cmir/freq = c -1
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/veclendiving/maxlpiterofs = c 1500
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.09/0.14 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/veclendiving/freq = c -1
0.09/0.14 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/simplerounding/freq = c -1
0.09/0.14 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/shifting/freq = c -1
0.09/0.14 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/rounding/freq = c -1
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.14 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.09/0.14 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.14 c heuristics/rootsoldiving/freq = c -1
0.09/0.14 c # number of nodes added to the contingent of the total nodes
0.09/0.14 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.14 c heuristics/rens/nodesofs = c 2000
0.09/0.14 c # minimum percentage of integer variables that have to be fixable
0.09/0.14 c # [type: real, range: [0,1], default: 0.5]
0.09/0.14 c heuristics/rens/minfixingrate = c 0.3
0.09/0.14 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.14 c heuristics/rens/freq = c -1
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.09/0.14 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/pscostdiving/freq = c -1
0.09/0.14 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.14 c heuristics/oneopt/freq = c -1
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.09/0.14 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.14 c # [type: real, range: [0,1], default: 0.01]
0.09/0.14 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.09/0.14 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.14 c heuristics/objpscostdiving/freq = c -1
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.09/0.14 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/linesearchdiving/freq = c -1
0.09/0.14 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/intshifting/freq = c -1
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/intdiving/maxlpiterquot = c 0.075
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/guideddiving/maxlpiterofs = c 1500
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.09/0.14 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/guideddiving/freq = c -1
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/fracdiving/maxlpiterofs = c 1500
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.09/0.14 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/fracdiving/freq = c -1
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/feaspump/maxlpiterofs = c 2000
0.09/0.14 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.14 c heuristics/feaspump/freq = c -1
0.09/0.14 c # minimum percentage of integer variables that have to be fixed
0.09/0.14 c # [type: real, range: [0,1], default: 0.666]
0.09/0.14 c heuristics/crossover/minfixingrate = c 0.5
0.09/0.14 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.14 c # [type: real, range: [0,1], default: 0.1]
0.09/0.14 c heuristics/crossover/nodesquot = c 0.15
0.09/0.14 c # number of nodes without incumbent change that heuristic should wait
0.09/0.14 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.14 c heuristics/crossover/nwaitingnodes = c 100
0.09/0.14 c # number of nodes added to the contingent of the total nodes
0.09/0.14 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.14 c heuristics/crossover/nodesofs = c 750
0.09/0.14 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.14 c heuristics/crossover/freq = c -1
0.09/0.14 c # additional number of allowed LP iterations
0.09/0.14 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.14 c heuristics/coefdiving/maxlpiterofs = c 1500
0.09/0.14 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.14 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.09/0.14 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.14 c heuristics/coefdiving/freq = c -1
0.09/0.14 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.14 c presolving/probing/maxrounds = c 0
0.09/0.14 c # should presolving try to simplify knapsacks
0.09/0.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.14 c constraints/knapsack/simplifyinequalities = c TRUE
0.09/0.14 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.14 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.14 c constraints/knapsack/disaggregation = c FALSE
0.09/0.14 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.14 c constraints/knapsack/maxnumcardlift = c 0
0.09/0.14 c # should presolving try to simplify inequalities
0.09/0.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.14 c constraints/linear/simplifyinequalities = c TRUE
0.09/0.14 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.14 c separating/maxroundsroot = c 5
0.09/0.14 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.14 c separating/maxrounds = c 1
0.09/0.14 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.14 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.14 c limits/solutions = c 1
0.09/0.14 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.14 c limits/memory = c 1620
0.09/0.14 c # maximal time in seconds to run
0.09/0.14 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.14 c limits/time = c 1791
0.09/0.14 c # frequency for displaying node information lines
0.09/0.14 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.14 c display/freq = c 10000
0.09/0.14 c -----------------------------------------------------------------------------------------------
0.09/0.14 c start solving problem
0.09/0.14 c
0.09/0.16 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.16 c 0.1s| 1 | 0 | 10 |3242k| 0 | 0 | 714 | 766 | 766 | 714 |1380 | 0 | 0 | 0 | 1.000000e+01 | -- | Inf
0.09/0.16 c * 0.1s| 1 | 0 | 10 |3248k| 0 | - | 714 | 766 | 766 | 714 |1380 | 0 | 0 | 0 | 1.000000e+01 | 1.000000e+01 | 0.00%
0.09/0.16 c
0.09/0.16 c SCIP Status : problem is solved [optimal solution found]
0.09/0.16 c Solving Time (sec) : 0.06
0.09/0.16 c Solving Nodes : 1
0.09/0.16 c Primal Bound : +1.00000000000000e+01 (1 solutions)
0.09/0.16 c Dual Bound : +1.00000000000000e+01
0.09/0.16 c Gap : 0.00 %
0.09/0.16 c NODE 1
0.09/0.16 c DUAL BOUND 10
0.09/0.16 c PRIMAL BOUND 10
0.09/0.16 c GAP 0
0.09/0.16 s SATISFIABLE
0.09/0.16 v x85 x63 x78 x89 x97 -x60 -x87 -x72 -x56 -x82 -x99 -x94 -x93 -x91 -x61 -x57 -x81 -x71 -x83 -x73 -x98 -x90 -x74 -x70 -x66 -x62 -x80
0.09/0.16 v -x69 -x68 -x100 -x92 -x53 -x54 -x65 -x55 -x51 -x96 -x67 -x59 -x58 -x95 -x86 -x79 -x76 -x88 -x64 -x77 -x75 -x84 -x52 -x50 -x49
0.09/0.16 v -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24
0.09/0.16 v -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 x5 x4 x3 x2 x1
0.09/0.16 c SCIP Status : problem is solved [optimal solution found]
0.09/0.16 c Solving Time : 0.06
0.09/0.16 c Original Problem :
0.09/0.16 c Problem name : HOME/instance-1870719-1245216871.opb
0.09/0.16 c Variables : 714 (714 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.16 c Constraints : 766 initial, 766 maximal
0.09/0.16 c Presolved Problem :
0.09/0.16 c Problem name : t_HOME/instance-1870719-1245216871.opb
0.09/0.16 c Variables : 714 (714 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.16 c Constraints : 766 initial, 766 maximal
0.09/0.16 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.09/0.16 c trivial : 0.00 0 0 0 0 0 0 0 0
0.09/0.16 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.09/0.16 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.09/0.16 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.09/0.16 c implics : 0.00 0 0 0 0 0 0 0 0
0.09/0.16 c probing : 0.00 0 0 0 0 0 0 0 0
0.09/0.16 c knapsack : 0.00 0 0 0 0 0 0 0 0
0.09/0.16 c setppc : 0.00 0 0 0 0 0 0 0 0
0.09/0.16 c and : 0.04 0 0 0 0 0 0 0 0
0.09/0.16 c linear : 0.00 0 0 0 0 0 0 0 0
0.09/0.16 c logicor : 0.00 0 0 0 0 0 0 0 0
0.09/0.16 c root node : - 0 - - 0 - - - -
0.09/0.16 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.09/0.16 c integral : 0 0 0 1 0 0 0 0 0 0
0.09/0.16 c knapsack : 1 1 1 1 0 0 0 0 0 0
0.09/0.16 c setppc : 100 1 1 1 0 0 0 0 0 0
0.09/0.16 c and : 614 1 1 1 0 0 0 0 0 0
0.09/0.16 c linear : 1 1 1 1 0 0 0 0 0 0
0.09/0.16 c logicor : 50 1 1 1 0 0 0 0 0 0
0.09/0.16 c countsols : 0 0 0 1 0 0 0 0 0 0
0.09/0.16 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.09/0.16 c integral : 0.00 0.00 0.00 0.00 0.00
0.09/0.16 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.09/0.16 c setppc : 0.00 0.00 0.00 0.00 0.00
0.09/0.16 c and : 0.00 0.00 0.00 0.00 0.00
0.09/0.16 c linear : 0.00 0.00 0.00 0.00 0.00
0.09/0.16 c logicor : 0.00 0.00 0.00 0.00 0.00
0.09/0.16 c countsols : 0.00 0.00 0.00 0.00 0.00
0.09/0.16 c Propagators : Time Calls Cutoffs DomReds
0.09/0.16 c rootredcost : 0.00 0 0 0
0.09/0.16 c pseudoobj : 0.00 2 0 0
0.09/0.16 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.09/0.16 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.16 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.16 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.16 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.16 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.16 c applied globally : - - - 0 0.0 - - -
0.09/0.16 c applied locally : - - - 0 0.0 - - -
0.09/0.16 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.09/0.16 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.09/0.16 c redcost : 0.00 1 0 0 0 0
0.09/0.16 c impliedbounds : 0.00 0 0 0 0 0
0.09/0.16 c intobj : 0.00 0 0 0 0 0
0.09/0.16 c gomory : 0.00 1 0 0 0 0
0.09/0.16 c strongcg : 0.00 1 0 0 0 0
0.09/0.16 c cmir : 0.00 0 0 0 0 0
0.09/0.16 c flowcover : 0.00 0 0 0 0 0
0.09/0.16 c clique : 0.00 1 0 0 0 0
0.09/0.16 c zerohalf : 0.00 0 0 0 0 0
0.09/0.16 c mcf : 0.00 1 0 0 0 0
0.09/0.16 c Pricers : Time Calls Vars
0.09/0.16 c problem variables: 0.00 0 0
0.09/0.16 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.09/0.16 c pscost : 0.00 0 0 0 0 0 0
0.09/0.16 c inference : 0.00 0 0 0 0 0 0
0.09/0.16 c mostinf : 0.00 0 0 0 0 0 0
0.09/0.16 c leastinf : 0.00 0 0 0 0 0 0
0.09/0.16 c fullstrong : 0.00 0 0 0 0 0 0
0.09/0.16 c allfullstrong : 0.00 0 0 0 0 0 0
0.09/0.16 c random : 0.00 0 0 0 0 0 0
0.09/0.16 c relpscost : 0.00 0 0 0 0 0 0
0.09/0.16 c Primal Heuristics : Time Calls Found
0.09/0.16 c LP solutions : 0.00 - 1
0.09/0.16 c pseudo solutions : 0.00 - 0
0.09/0.16 c simplerounding : 0.00 0 0
0.09/0.16 c rounding : 0.00 0 0
0.09/0.16 c shifting : 0.00 0 0
0.09/0.16 c intshifting : 0.00 0 0
0.09/0.16 c oneopt : 0.00 0 0
0.09/0.16 c fixandinfer : 0.00 0 0
0.09/0.16 c feaspump : 0.00 0 0
0.09/0.16 c coefdiving : 0.00 0 0
0.09/0.16 c pscostdiving : 0.00 0 0
0.09/0.16 c fracdiving : 0.00 0 0
0.09/0.16 c veclendiving : 0.00 0 0
0.09/0.16 c intdiving : 0.00 0 0
0.09/0.16 c actconsdiving : 0.00 0 0
0.09/0.16 c objpscostdiving : 0.00 0 0
0.09/0.16 c rootsoldiving : 0.00 0 0
0.09/0.16 c linesearchdiving : 0.00 0 0
0.09/0.16 c guideddiving : 0.00 0 0
0.09/0.16 c octane : 0.00 0 0
0.09/0.16 c rens : 0.00 0 0
0.09/0.16 c rins : 0.00 0 0
0.09/0.16 c localbranching : 0.00 0 0
0.09/0.16 c mutation : 0.00 0 0
0.09/0.16 c crossover : 0.00 0 0
0.09/0.16 c dins : 0.00 0 0
0.09/0.16 c LP : Time Calls Iterations Iter/call Iter/sec
0.09/0.16 c primal LP : 0.00 0 0 0.00 -
0.09/0.16 c dual LP : 0.00 1 10 10.00 -
0.09/0.16 c barrier LP : 0.00 0 0 0.00 -
0.09/0.16 c diving/probing LP: 0.00 0 0 0.00 -
0.09/0.16 c strong branching : 0.00 0 0 0.00 -
0.09/0.16 c (at root node) : - 0 0 0.00 -
0.09/0.16 c conflict analysis: 0.00 0 0 0.00 -
0.09/0.16 c B&B Tree :
0.09/0.16 c number of runs : 1
0.09/0.16 c nodes : 1
0.09/0.16 c nodes (total) : 1
0.09/0.16 c nodes left : 0
0.09/0.16 c max depth : 0
0.09/0.16 c max depth (total): 0
0.09/0.16 c backtracks : 0 (0.0%)
0.09/0.16 c delayed cutoffs : 0
0.09/0.16 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.09/0.16 c avg switch length: 2.00
0.09/0.16 c switching time : 0.00
0.09/0.16 c Solution :
0.09/0.16 c Solutions found : 1 (1 improvements)
0.09/0.16 c Primal Bound : +1.00000000000000e+01 (in run 1, after 1 nodes, 0.06 seconds, depth 0, found by <relaxation>)
0.09/0.16 c Dual Bound : +1.00000000000000e+01
0.09/0.16 c Gap : 0.00 %
0.09/0.16 c Root Dual Bound : +1.00000000000000e+01
0.09/0.18 c Time complete: 0.17.