0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 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-2685332-1278440585.opb>
0.89/0.96 c original problem has 15106 variables (15106 bin, 0 int, 0 impl, 0 cont) and 51743 constraints
0.89/0.96 c problem read
0.89/0.96 c No objective function, only one solution is needed.
0.89/0.96 c presolving settings loaded
0.89/0.96 c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
1.19/1.24 c presolving:
2.89/2.94 c presolving (1 rounds):
2.89/2.94 c 1913 deleted vars, 6721 deleted constraints, 1913 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.89/2.94 c 2059036 implications, 0 cliques
2.89/2.95 c presolving detected infeasibility
2.89/2.95 c Presolving Time: 1.71
2.89/2.95 c - non default parameters ----------------------------------------------------------------------
2.89/2.95 c # SCIP version 1.2.1.2
2.89/2.95 c
2.89/2.95 c # frequency for displaying node information lines
2.89/2.95 c # [type: int, range: [-1,2147483647], default: 100]
2.89/2.95 c display/freq = 10000
2.89/2.95 c
2.89/2.95 c # maximal time in seconds to run
2.89/2.95 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.89/2.95 c limits/time = 1799.05
2.89/2.95 c
2.89/2.95 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
2.89/2.95 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.89/2.95 c limits/memory = 1620
2.89/2.95 c
2.89/2.95 c # solving stops, if the given number of solutions were found (-1: no limit)
2.89/2.95 c # [type: int, range: [-1,2147483647], default: -1]
2.89/2.95 c limits/solutions = 1
2.89/2.95 c
2.89/2.95 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
2.89/2.95 c # [type: int, range: [-1,2147483647], default: 1]
2.89/2.95 c lp/solvefreq = -1
2.89/2.95 c
2.89/2.95 c # maximal number of separation rounds per node (-1: unlimited)
2.89/2.95 c # [type: int, range: [-1,2147483647], default: 5]
2.89/2.95 c separating/maxrounds = 1
2.89/2.95 c
2.89/2.95 c # maximal number of separation rounds in the root node (-1: unlimited)
2.89/2.95 c # [type: int, range: [-1,2147483647], default: -1]
2.89/2.95 c separating/maxroundsroot = 5
2.89/2.95 c
2.89/2.95 c # should presolving try to simplify inequalities
2.89/2.95 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.89/2.95 c constraints/linear/simplifyinequalities = TRUE
2.89/2.95 c
2.89/2.95 c # should disaggregation of knapsack constraints be allowed in preprocessing?
2.89/2.95 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
2.89/2.95 c constraints/knapsack/disaggregation = FALSE
2.89/2.95 c
2.89/2.95 c # should presolving try to simplify knapsacks
2.89/2.95 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.89/2.95 c constraints/knapsack/simplifyinequalities = TRUE
2.89/2.95 c
2.89/2.95 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
2.89/2.95 c # [type: int, range: [-1,2147483647], default: -1]
2.89/2.95 c presolving/probing/maxrounds = 0
2.89/2.95 c
2.89/2.95 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
2.89/2.95 c # [type: int, range: [-1,2147483647], default: 10]
2.89/2.95 c heuristics/coefdiving/freq = -1
2.89/2.95 c
2.89/2.95 c # maximal fraction of diving LP iterations compared to node LP iterations
2.89/2.95 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.89/2.95 c heuristics/coefdiving/maxlpiterquot = 0.075
2.89/2.95 c
2.89/2.95 c # additional number of allowed LP iterations
2.89/2.95 c # [type: int, range: [0,2147483647], default: 1000]
2.89/2.95 c heuristics/coefdiving/maxlpiterofs = 1500
2.89/2.95 c
2.89/2.95 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
2.89/2.95 c # [type: int, range: [-1,2147483647], default: 30]
2.89/2.95 c heuristics/crossover/freq = -1
2.89/2.95 c
2.89/2.95 c # number of nodes added to the contingent of the total nodes
2.89/2.95 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.89/2.95 c heuristics/crossover/nodesofs = 750
2.89/2.95 c
2.89/2.95 c # number of nodes without incumbent change that heuristic should wait
2.89/2.95 c # [type: longint, range: [0,9223372036854775807], default: 200]
2.89/2.95 c heuristics/crossover/nwaitingnodes = 100
2.89/2.95 c
2.89/2.95 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
2.89/2.95 c # [type: real, range: [0,1], default: 0.1]
2.89/2.95 c heuristics/crossover/nodesquot = 0.15
2.89/2.95 c
2.89/2.95 c # minimum percentage of integer variables that have to be fixed
2.89/2.95 c # [type: real, range: [0,1], default: 0.666]
2.89/2.95 c heuristics/crossover/minfixingrate = 0.5
2.89/2.95 c
2.89/2.95 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
2.89/2.95 c # [type: int, range: [-1,2147483647], default: 20]
2.89/2.95 c heuristics/feaspump/freq = -1
2.89/2.95 c
2.89/2.95 c # additional number of allowed LP iterations
2.89/2.95 c # [type: int, range: [0,2147483647], default: 1000]
2.89/2.95 c heuristics/feaspump/maxlpiterofs = 2000
2.89/2.95 c
2.89/2.95 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
2.89/2.95 c # [type: int, range: [-1,2147483647], default: 10]
2.89/2.95 c heuristics/fracdiving/freq = -1
2.89/2.95 c
2.89/2.95 c # maximal fraction of diving LP iterations compared to node LP iterations
2.89/2.95 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.89/2.95 c heuristics/fracdiving/maxlpiterquot = 0.075
2.89/2.95 c
2.89/2.95 c # additional number of allowed LP iterations
2.89/2.95 c # [type: int, range: [0,2147483647], default: 1000]
2.89/2.95 c heuristics/fracdiving/maxlpiterofs = 1500
2.89/2.95 c
2.89/2.95 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
2.89/2.95 c # [type: int, range: [-1,2147483647], default: 10]
2.89/2.95 c heuristics/guideddiving/freq = -1
2.89/2.95 c
2.89/2.95 c # maximal fraction of diving LP iterations compared to node LP iterations
2.89/2.95 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.89/2.95 c heuristics/guideddiving/maxlpiterquot = 0.075
2.89/2.95 c
2.89/2.95 c # additional number of allowed LP iterations
2.89/2.95 c # [type: int, range: [0,2147483647], default: 1000]
2.89/2.95 c heuristics/guideddiving/maxlpiterofs = 1500
2.89/2.95 c
2.89/2.95 c # maximal fraction of diving LP iterations compared to node LP iterations
2.89/2.95 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.89/2.95 c heuristics/intdiving/maxlpiterquot = 0.075
2.89/2.95 c
2.89/2.95 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
2.89/2.95 c # [type: int, range: [-1,2147483647], default: 10]
2.89/2.95 c heuristics/intshifting/freq = -1
2.89/2.95 c
2.89/2.95 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
2.89/2.95 c # [type: int, range: [-1,2147483647], default: 10]
2.89/2.95 c heuristics/linesearchdiving/freq = -1
2.89/2.95 c
2.89/2.95 c # maximal fraction of diving LP iterations compared to node LP iterations
2.89/2.95 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.89/2.95 c heuristics/linesearchdiving/maxlpiterquot = 0.075
2.89/2.95 c
2.89/2.95 c # additional number of allowed LP iterations
2.89/2.95 c # [type: int, range: [0,2147483647], default: 1000]
2.89/2.95 c heuristics/linesearchdiving/maxlpiterofs = 1500
2.89/2.95 c
2.89/2.95 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
2.89/2.95 c # [type: int, range: [-1,2147483647], default: 1]
2.89/2.95 c heuristics/nlp/freq = -1
2.89/2.95 c
2.89/2.95 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
2.89/2.95 c # [type: int, range: [-1,2147483647], default: 20]
2.89/2.95 c heuristics/objpscostdiving/freq = -1
2.89/2.95 c
2.89/2.95 c # maximal fraction of diving LP iterations compared to total iteration number
2.89/2.95 c # [type: real, range: [0,1], default: 0.01]
2.89/2.95 c heuristics/objpscostdiving/maxlpiterquot = 0.015
2.89/2.95 c
2.89/2.95 c # additional number of allowed LP iterations
2.89/2.95 c # [type: int, range: [0,2147483647], default: 1000]
2.89/2.95 c heuristics/objpscostdiving/maxlpiterofs = 1500
2.89/2.95 c
2.89/2.95 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
2.89/2.95 c # [type: int, range: [-1,2147483647], default: 1]
2.89/2.95 c heuristics/oneopt/freq = -1
2.89/2.95 c
2.89/2.95 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
2.89/2.95 c # [type: int, range: [-1,2147483647], default: 10]
2.89/2.95 c heuristics/pscostdiving/freq = -1
2.89/2.95 c
2.89/2.95 c # maximal fraction of diving LP iterations compared to node LP iterations
2.89/2.95 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.89/2.95 c heuristics/pscostdiving/maxlpiterquot = 0.075
2.89/2.95 c
2.89/2.95 c # additional number of allowed LP iterations
2.89/2.95 c # [type: int, range: [0,2147483647], default: 1000]
2.89/2.95 c heuristics/pscostdiving/maxlpiterofs = 1500
2.89/2.95 c
2.89/2.95 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
2.89/2.95 c # [type: int, range: [-1,2147483647], default: 0]
2.89/2.95 c heuristics/rens/freq = -1
2.89/2.95 c
2.89/2.95 c # minimum percentage of integer variables that have to be fixable
2.89/2.95 c # [type: real, range: [0,1], default: 0.5]
2.89/2.95 c heuristics/rens/minfixingrate = 0.3
2.89/2.95 c
2.89/2.95 c # number of nodes added to the contingent of the total nodes
2.89/2.95 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.89/2.95 c heuristics/rens/nodesofs = 2000
2.89/2.95 c
2.89/2.95 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
2.89/2.95 c # [type: int, range: [-1,2147483647], default: 20]
2.89/2.95 c heuristics/rootsoldiving/freq = -1
2.89/2.95 c
2.89/2.95 c # maximal fraction of diving LP iterations compared to node LP iterations
2.89/2.95 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
2.89/2.96 c heuristics/rootsoldiving/maxlpiterquot = 0.015
2.89/2.96 c
2.89/2.96 c # additional number of allowed LP iterations
2.89/2.96 c # [type: int, range: [0,2147483647], default: 1000]
2.89/2.96 c heuristics/rootsoldiving/maxlpiterofs = 1500
2.89/2.96 c
2.89/2.96 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
2.89/2.96 c # [type: int, range: [-1,2147483647], default: 1]
2.89/2.96 c heuristics/rounding/freq = -1
2.89/2.96 c
2.89/2.96 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
2.89/2.96 c # [type: int, range: [-1,2147483647], default: 10]
2.89/2.96 c heuristics/shifting/freq = -1
2.89/2.96 c
2.89/2.96 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
2.89/2.96 c # [type: int, range: [-1,2147483647], default: 1]
2.89/2.96 c heuristics/simplerounding/freq = -1
2.89/2.96 c
2.89/2.96 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
2.89/2.96 c # [type: int, range: [-1,2147483647], default: 0]
2.89/2.96 c heuristics/trivial/freq = -1
2.89/2.96 c
2.89/2.96 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
2.89/2.96 c # [type: int, range: [-1,2147483647], default: 1]
2.89/2.96 c heuristics/trysol/freq = -1
2.89/2.96 c
2.89/2.96 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
2.89/2.96 c # [type: int, range: [-1,2147483647], default: 10]
2.89/2.96 c heuristics/veclendiving/freq = -1
2.89/2.96 c
2.89/2.96 c # maximal fraction of diving LP iterations compared to node LP iterations
2.89/2.96 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.89/2.96 c heuristics/veclendiving/maxlpiterquot = 0.075
2.89/2.96 c
2.89/2.96 c # additional number of allowed LP iterations
2.89/2.96 c # [type: int, range: [0,2147483647], default: 1000]
2.89/2.96 c heuristics/veclendiving/maxlpiterofs = 1500
2.89/2.96 c
2.89/2.96 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
2.89/2.96 c # [type: int, range: [-1,2147483647], default: 1]
2.89/2.96 c heuristics/zirounding/freq = -1
2.89/2.96 c
2.89/2.96 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
2.89/2.96 c # [type: int, range: [-1,2147483647], default: 0]
2.89/2.96 c separating/cmir/freq = -1
2.89/2.96 c
2.89/2.96 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
2.89/2.96 c # [type: int, range: [-1,2147483647], default: 0]
2.89/2.96 c separating/flowcover/freq = -1
2.89/2.96 c
2.89/2.96 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
2.89/2.96 c # [type: int, range: [-1,2147483647], default: -1]
2.89/2.96 c separating/rapidlearning/freq = 0
2.89/2.96 c
2.89/2.96 c -----------------------------------------------------------------------------------------------
2.89/2.96 c start solving
2.89/2.96 c
2.89/2.96 c SCIP Status : problem is solved [infeasible]
2.89/2.96 c Solving Time (sec) : 1.88
2.89/2.96 c Solving Nodes : 0
2.89/2.96 c Primal Bound : +1.00000000000000e+20 (0 solutions)
2.89/2.96 c Dual Bound : -1.00000000000000e+20
2.89/2.96 c Gap : infinite
2.89/2.96 s UNSATISFIABLE
2.89/2.96 c SCIP Status : problem is solved [infeasible]
2.89/2.96 c Solving Time : 1.88
2.89/2.96 c Original Problem :
2.89/2.96 c Problem name : HOME/instance-2685332-1278440585.opb
2.89/2.96 c Variables : 15106 (15106 binary, 0 integer, 0 implicit integer, 0 continuous)
2.89/2.96 c Constraints : 51743 initial, 51743 maximal
2.89/2.96 c Presolved Problem :
2.89/2.96 c Problem name : t_HOME/instance-2685332-1278440585.opb
2.89/2.96 c Variables : 13193 (13193 binary, 0 integer, 0 implicit integer, 0 continuous)
2.89/2.96 c Constraints : 45022 initial, 45022 maximal
2.89/2.96 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.89/2.96 c trivial : 0.01 0 0 0 0 0 0 0 0
2.89/2.96 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.89/2.96 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.89/2.96 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.89/2.96 c implics : 0.00 0 0 0 0 0 0 0 0
2.89/2.96 c probing : 0.00 0 0 0 0 0 0 0 0
2.89/2.96 c linear : 1.58 1913 0 0 1913 0 6721 0 0
2.89/2.96 c root node : - 0 - - 0 - - - -
2.89/2.96 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.89/2.96 c integral : 0 0 0 0 0 0 0 0 0 0
2.89/2.96 c linear : 45022 0 0 0 0 0 0 0 0 0
2.89/2.96 c countsols : 0 0 0 0 0 0 0 0 0 0
2.89/2.96 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.89/2.96 c integral : 0.00 0.00 0.00 0.00 0.00
2.89/2.96 c linear : 0.00 0.00 0.00 0.00 0.00
2.89/2.96 c countsols : 0.00 0.00 0.00 0.00 0.00
2.89/2.96 c Propagators : Time Calls Cutoffs DomReds
2.89/2.96 c pseudoobj : 0.00 0 0 0
2.89/2.96 c rootredcost : 0.00 0 0 0
2.89/2.96 c vbounds : 0.00 0 0 0
2.89/2.96 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.89/2.96 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.89/2.96 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.89/2.96 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.89/2.96 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.89/2.96 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.89/2.96 c applied globally : - - - 0 0.0 - - -
2.89/2.96 c applied locally : - - - 0 0.0 - - -
2.89/2.96 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.89/2.96 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
2.89/2.96 c redcost : 0.00 0 0 0 0 0
2.89/2.96 c impliedbounds : 0.00 0 0 0 0 0
2.89/2.96 c intobj : 0.00 0 0 0 0 0
2.89/2.96 c cgmip : 0.00 0 0 0 0 0
2.89/2.96 c gomory : 0.00 0 0 0 0 0
2.89/2.96 c strongcg : 0.00 0 0 0 0 0
2.89/2.96 c cmir : 0.00 0 0 0 0 0
2.89/2.96 c flowcover : 0.00 0 0 0 0 0
2.89/2.96 c clique : 0.00 0 0 0 0 0
2.89/2.96 c zerohalf : 0.00 0 0 0 0 0
2.89/2.96 c mcf : 0.00 0 0 0 0 0
2.89/2.96 c rapidlearning : 0.00 0 0 0 0 0
2.89/2.96 c Pricers : Time Calls Vars
2.89/2.96 c problem variables: 0.00 0 0
2.89/2.96 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.89/2.96 c pscost : 0.00 0 0 0 0 0 0
2.89/2.96 c inference : 0.00 0 0 0 0 0 0
2.89/2.96 c mostinf : 0.00 0 0 0 0 0 0
2.89/2.96 c leastinf : 0.00 0 0 0 0 0 0
2.89/2.96 c fullstrong : 0.00 0 0 0 0 0 0
2.89/2.96 c allfullstrong : 0.00 0 0 0 0 0 0
2.89/2.96 c random : 0.00 0 0 0 0 0 0
2.89/2.96 c relpscost : 0.00 0 0 0 0 0 0
2.89/2.96 c Primal Heuristics : Time Calls Found
2.89/2.96 c LP solutions : 0.00 - 0
2.89/2.96 c pseudo solutions : 0.00 - 0
2.89/2.96 c trivial : 0.02 1 0
2.89/2.96 c simplerounding : 0.00 0 0
2.89/2.96 c zirounding : 0.00 0 0
2.89/2.96 c rounding : 0.00 0 0
2.89/2.96 c shifting : 0.00 0 0
2.89/2.96 c intshifting : 0.00 0 0
2.89/2.96 c oneopt : 0.00 0 0
2.89/2.96 c twoopt : 0.00 0 0
2.89/2.96 c fixandinfer : 0.00 0 0
2.89/2.96 c feaspump : 0.00 0 0
2.89/2.96 c coefdiving : 0.00 0 0
2.89/2.96 c pscostdiving : 0.00 0 0
2.89/2.96 c fracdiving : 0.00 0 0
2.89/2.96 c veclendiving : 0.00 0 0
2.89/2.96 c intdiving : 0.00 0 0
2.89/2.96 c actconsdiving : 0.00 0 0
2.89/2.96 c objpscostdiving : 0.00 0 0
2.89/2.96 c rootsoldiving : 0.00 0 0
2.89/2.96 c linesearchdiving : 0.00 0 0
2.89/2.96 c guideddiving : 0.00 0 0
2.89/2.96 c octane : 0.00 0 0
2.89/2.96 c rens : 0.00 0 0
2.89/2.96 c rins : 0.00 0 0
2.89/2.96 c localbranching : 0.00 0 0
2.89/2.96 c mutation : 0.00 0 0
2.89/2.96 c crossover : 0.00 0 0
2.89/2.96 c dins : 0.00 0 0
2.89/2.96 c undercover : 0.00 0 0
2.89/2.96 c nlp : 0.00 0 0
2.89/2.96 c trysol : 0.00 0 0
2.89/2.96 c LP : Time Calls Iterations Iter/call Iter/sec
2.89/2.96 c primal LP : 0.00 0 0 0.00 -
2.89/2.96 c dual LP : 0.00 0 0 0.00 -
2.89/2.96 c lex dual LP : 0.00 0 0 0.00 -
2.89/2.96 c barrier LP : 0.00 0 0 0.00 -
2.89/2.96 c diving/probing LP: 0.00 0 0 0.00 -
2.89/2.96 c strong branching : 0.00 0 0 0.00 -
2.89/2.96 c (at root node) : - 0 0 0.00 -
2.89/2.96 c conflict analysis: 0.00 0 0 0.00 -
2.89/2.96 c B&B Tree :
2.89/2.96 c number of runs : 1
2.89/2.96 c nodes : 0
2.89/2.96 c nodes (total) : 0
2.89/2.96 c nodes left : 1
2.89/2.96 c max depth : -1
2.89/2.96 c max depth (total): -1
2.89/2.96 c backtracks : 0 (0.0%)
2.89/2.96 c delayed cutoffs : 0
2.89/2.96 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.89/2.96 c avg switch length: 0.00
2.89/2.96 c switching time : 0.00
2.89/2.96 c Solution :
2.89/2.96 c Solutions found : 0 (0 improvements)
2.89/2.96 c Primal Bound : infeasible
2.89/2.96 c Dual Bound : -
2.89/2.96 c Gap : infinite
2.89/2.96 c Root Dual Bound : -
2.89/2.96 c Root Iterations : 0
3.09/3.15 c Time complete: 3.15.