0.00/0.02 c SCIP version 1.1.0.7
0.00/0.02 c LP-Solver SoPlex 1.4.1
0.00/0.02 c user parameter file <scip.set> not found - using default parameters
0.00/0.02 c read problem <HOME/instance-1870728-1245217442.opb>
0.00/0.02 c original problem has 1576 variables (1576 bin, 0 int, 0 impl, 0 cont) and 1628 constraints
0.00/0.03 c No objective function, only one solution is needed.
0.00/0.03 c start presolving problem
0.00/0.03 c presolving:
0.09/0.18 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 11908 impls, 100 clqs
0.29/0.31 c presolving (2 rounds):
0.29/0.31 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.31 c 11908 implications, 100 cliques
0.29/0.31 c presolved problem has 1576 variables (1576 bin, 0 int, 0 impl, 0 cont) and 1628 constraints
0.29/0.31 c 1 constraints of type <knapsack>
0.29/0.31 c 100 constraints of type <setppc>
0.29/0.31 c 1476 constraints of type <and>
0.29/0.31 c 1 constraints of type <linear>
0.29/0.31 c 50 constraints of type <logicor>
0.29/0.31 c transformed objective value is always integral (scale: 1)
0.29/0.31 c Presolving Time: 0.12
0.29/0.31 c SATUNSAT-NLC
0.29/0.31 c -----------------------------------------------------------------------------------------------
0.29/0.31 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.31 c separating/flowcover/freq = c -1
0.29/0.31 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.31 c separating/cmir/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/veclendiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.29/0.31 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/veclendiving/freq = c -1
0.29/0.31 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.31 c heuristics/simplerounding/freq = c -1
0.29/0.31 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/shifting/freq = c -1
0.29/0.31 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.31 c heuristics/rounding/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.31 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.29/0.31 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.31 c heuristics/rootsoldiving/freq = c -1
0.29/0.31 c # number of nodes added to the contingent of the total nodes
0.29/0.31 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.31 c heuristics/rens/nodesofs = c 2000
0.29/0.31 c # minimum percentage of integer variables that have to be fixable
0.29/0.31 c # [type: real, range: [0,1], default: 0.5]
0.29/0.31 c heuristics/rens/minfixingrate = c 0.3
0.29/0.31 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.31 c heuristics/rens/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.29/0.31 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/pscostdiving/freq = c -1
0.29/0.31 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.31 c heuristics/oneopt/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.31 c # [type: real, range: [0,1], default: 0.01]
0.29/0.31 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.29/0.31 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.31 c heuristics/objpscostdiving/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.29/0.31 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/linesearchdiving/freq = c -1
0.29/0.31 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/intshifting/freq = c -1
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/intdiving/maxlpiterquot = c 0.075
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/guideddiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.29/0.31 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/guideddiving/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/fracdiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.29/0.31 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/fracdiving/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/feaspump/maxlpiterofs = c 2000
0.29/0.31 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.31 c heuristics/feaspump/freq = c -1
0.29/0.31 c # minimum percentage of integer variables that have to be fixed
0.29/0.31 c # [type: real, range: [0,1], default: 0.666]
0.29/0.31 c heuristics/crossover/minfixingrate = c 0.5
0.29/0.31 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.31 c # [type: real, range: [0,1], default: 0.1]
0.29/0.31 c heuristics/crossover/nodesquot = c 0.15
0.29/0.31 c # number of nodes without incumbent change that heuristic should wait
0.29/0.31 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.31 c heuristics/crossover/nwaitingnodes = c 100
0.29/0.31 c # number of nodes added to the contingent of the total nodes
0.29/0.31 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.31 c heuristics/crossover/nodesofs = c 750
0.29/0.31 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.31 c heuristics/crossover/freq = c -1
0.29/0.31 c # additional number of allowed LP iterations
0.29/0.31 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.31 c heuristics/coefdiving/maxlpiterofs = c 1500
0.29/0.31 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.31 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.31 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.29/0.31 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.31 c heuristics/coefdiving/freq = c -1
0.29/0.31 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.31 c presolving/probing/maxrounds = c 0
0.29/0.31 c # should presolving try to simplify knapsacks
0.29/0.31 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.31 c constraints/knapsack/simplifyinequalities = c TRUE
0.29/0.31 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.31 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.31 c constraints/knapsack/disaggregation = c FALSE
0.29/0.31 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.29/0.31 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.31 c constraints/knapsack/maxnumcardlift = c 0
0.29/0.31 c # should presolving try to simplify inequalities
0.29/0.32 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.32 c constraints/linear/simplifyinequalities = c TRUE
0.29/0.32 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.32 c separating/maxroundsroot = c 5
0.29/0.32 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.32 c separating/maxrounds = c 1
0.29/0.32 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.32 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.32 c limits/solutions = c 1
0.29/0.32 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.32 c limits/memory = c 1620
0.29/0.32 c # maximal time in seconds to run
0.29/0.32 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.32 c limits/time = c 1791
0.29/0.32 c # frequency for displaying node information lines
0.29/0.32 c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.32 c display/freq = c 10000
0.29/0.32 c -----------------------------------------------------------------------------------------------
0.29/0.32 c start solving problem
0.29/0.32 c
0.29/0.36 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.36 c 0.2s| 1 | 0 | 101 |7097k| 0 | 60 |1576 |1628 |1628 |1576 |3104 | 0 | 0 | 0 | 3.000000e+01 | -- | Inf
0.49/0.56 c 0.4s| 1 | 0 | 104 |7117k| 0 | 60 |1576 |1628 |1628 |1576 |3105 | 1 | 0 | 0 | 3.000000e+01 | -- | Inf
0.69/0.74 c 0.5s| 1 | 0 | 113 |7140k| 0 | 62 |1576 |1628 |1628 |1576 |3106 | 2 | 0 | 0 | 3.000000e+01 | -- | Inf
0.89/0.96 c 0.7s| 1 | 0 | 131 |7171k| 0 | 60 |1576 |1628 |1628 |1576 |3107 | 3 | 0 | 0 | 3.000000e+01 | -- | Inf
1.39/1.43 c 1.2s| 1 | 0 | 212 |7212k| 0 | 62 |1576 |1628 |1628 |1576 |3108 | 4 | 0 | 0 | 3.000000e+01 | -- | Inf
1.99/2.08 c 1.9s| 1 | 0 | 251 |7291k| 0 | 63 |1576 |1628 |1628 |1576 |3109 | 5 | 0 | 0 | 3.000000e+01 | -- | Inf
7.39/7.48 c 7.2s| 1 | 2 | 251 |7292k| 0 | 63 |1576 |1628 |1628 |1576 |3109 | 5 | 0 | 18 | 3.000000e+01 | -- | Inf
19.88/19.98 c
19.88/19.98 c SCIP Status : problem is solved [infeasible]
19.88/19.98 c Solving Time (sec) : 19.55
19.88/19.98 c Solving Nodes : 237
19.88/19.98 c Primal Bound : +1.00000000000000e+20 (0 solutions)
19.88/19.98 c Dual Bound : +1.00000000000000e+20
19.88/19.98 c Gap : 0.00 %
19.88/19.98 c NODE 237
19.88/19.98 c DUAL BOUND 1e+20
19.88/19.98 c PRIMAL BOUND 1e+20
19.88/19.98 c GAP 0
19.88/19.98 s UNSATISFIABLE
19.88/19.98 c SCIP Status : problem is solved [infeasible]
19.88/19.98 c Solving Time : 19.55
19.88/19.98 c Original Problem :
19.88/19.98 c Problem name : HOME/instance-1870728-1245217442.opb
19.88/19.98 c Variables : 1576 (1576 binary, 0 integer, 0 implicit integer, 0 continuous)
19.88/19.98 c Constraints : 1628 initial, 1628 maximal
19.88/19.98 c Presolved Problem :
19.88/19.98 c Problem name : t_HOME/instance-1870728-1245217442.opb
19.88/19.98 c Variables : 1576 (1576 binary, 0 integer, 0 implicit integer, 0 continuous)
19.88/19.98 c Constraints : 1628 initial, 1650 maximal
19.88/19.98 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
19.88/19.98 c trivial : 0.00 0 0 0 0 0 0 0 0
19.88/19.98 c dualfix : 0.00 0 0 0 0 0 0 0 0
19.88/19.98 c boundshift : 0.00 0 0 0 0 0 0 0 0
19.88/19.98 c inttobinary : 0.00 0 0 0 0 0 0 0 0
19.88/19.98 c implics : 0.00 0 0 0 0 0 0 0 0
19.88/19.98 c probing : 0.00 0 0 0 0 0 0 0 0
19.88/19.98 c knapsack : 0.00 0 0 0 0 0 0 0 0
19.88/19.98 c setppc : 0.00 0 0 0 0 0 0 0 0
19.88/19.98 c and : 0.10 0 0 0 0 0 0 0 0
19.88/19.98 c linear : 0.01 0 0 0 0 0 0 0 0
19.88/19.98 c logicor : 0.00 0 0 0 0 0 0 0 0
19.88/19.98 c root node : - 112 - - 112 - - - -
19.88/19.98 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
19.88/19.98 c integral : 0 0 0 160 0 4 66 0 0 248
19.88/19.98 c knapsack : 1 5 961 13 0 8 41 0 0 0
19.88/19.98 c setppc : 100 5 954 13 0 1 1092 0 0 0
19.88/19.98 c and : 1476 224 953 13 0 0 20371 25247 0 0
19.88/19.98 c linear : 1 5 953 0 0 3 0 0 0 0
19.88/19.98 c logicor : 50+ 5 283 0 0 0 197 0 0 0
19.88/19.98 c countsols : 0 0 0 0 0 0 0 0 0 0
19.88/19.98 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
19.88/19.98 c integral : 12.80 0.00 0.00 12.80 0.00
19.88/19.98 c knapsack : 0.00 0.00 0.00 0.00 0.00
19.88/19.98 c setppc : 0.00 0.00 0.00 0.00 0.00
19.88/19.98 c and : 0.35 0.27 0.08 0.00 0.00
19.88/19.98 c linear : 0.01 0.00 0.01 0.00 0.00
19.88/19.98 c logicor : 0.00 0.00 0.00 0.00 0.00
19.88/19.98 c countsols : 0.00 0.00 0.00 0.00 0.00
19.88/19.98 c Propagators : Time Calls Cutoffs DomReds
19.88/19.98 c rootredcost : 0.00 0 0 0
19.88/19.98 c pseudoobj : 0.10 964 1 0
19.88/19.98 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
19.88/19.98 c propagation : 0.00 12 10 20 7.2 0 0.0 -
19.88/19.98 c infeasible LP : 0.05 82 82 329 16.3 0 0.0 0
19.88/19.98 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
19.88/19.98 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
19.88/19.98 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
19.88/19.98 c applied globally : - - - 137 12.5 - - -
19.88/19.98 c applied locally : - - - 0 0.0 - - -
19.88/19.98 c Separators : Time Calls Cutoffs DomReds Cuts Conss
19.88/19.98 c cut pool : 0.00 4 - - 0 - (maximal pool size: 37)
19.88/19.98 c redcost : 0.03 224 0 0 0 0
19.88/19.98 c impliedbounds : 0.00 5 0 0 0 0
19.88/19.98 c intobj : 0.00 0 0 0 0 0
19.88/19.98 c gomory : 0.88 5 0 0 1500 0
19.88/19.98 c strongcg : 0.69 5 0 0 2398 0
19.88/19.98 c cmir : 0.00 0 0 0 0 0
19.88/19.98 c flowcover : 0.00 0 0 0 0 0
19.88/19.98 c clique : 0.00 5 0 0 0 0
19.88/19.98 c zerohalf : 0.00 0 0 0 0 0
19.88/19.98 c mcf : 0.01 2 0 0 0 0
19.88/19.98 c Pricers : Time Calls Vars
19.88/19.98 c problem variables: 0.00 0 0
19.88/19.98 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
19.88/19.98 c relpscost : 12.80 147 4 66 0 0 248
19.88/19.98 c pscost : 0.00 0 0 0 0 0 0
19.88/19.98 c inference : 0.00 0 0 0 0 0 0
19.88/19.98 c mostinf : 0.00 0 0 0 0 0 0
19.88/19.98 c leastinf : 0.00 0 0 0 0 0 0
19.88/19.98 c fullstrong : 0.00 0 0 0 0 0 0
19.88/19.98 c allfullstrong : 0.00 0 0 0 0 0 0
19.88/19.98 c random : 0.00 0 0 0 0 0 0
19.88/19.98 c Primal Heuristics : Time Calls Found
19.88/19.98 c LP solutions : 0.00 - 0
19.88/19.98 c pseudo solutions : 0.00 - 0
19.88/19.98 c simplerounding : 0.00 0 0
19.88/19.98 c rounding : 0.00 0 0
19.88/19.98 c shifting : 0.00 0 0
19.88/19.98 c intshifting : 0.00 0 0
19.88/19.98 c oneopt : 0.00 0 0
19.88/19.98 c fixandinfer : 0.00 0 0
19.88/19.98 c feaspump : 0.00 0 0
19.88/19.98 c coefdiving : 0.00 0 0
19.88/19.98 c pscostdiving : 0.00 0 0
19.88/19.98 c fracdiving : 0.00 0 0
19.88/19.98 c veclendiving : 0.00 0 0
19.88/19.98 c intdiving : 0.00 0 0
19.88/19.98 c actconsdiving : 0.00 0 0
19.88/19.98 c objpscostdiving : 0.00 0 0
19.88/19.98 c rootsoldiving : 0.00 0 0
19.88/19.98 c linesearchdiving : 0.00 0 0
19.88/19.98 c guideddiving : 0.00 0 0
19.88/19.98 c octane : 0.00 0 0
19.88/19.98 c rens : 0.00 0 0
19.88/19.98 c rins : 0.00 0 0
19.88/19.98 c localbranching : 0.00 0 0
19.88/19.98 c mutation : 0.00 0 0
19.88/19.98 c crossover : 0.00 0 0
19.88/19.98 c dins : 0.00 0 0
19.88/19.98 c LP : Time Calls Iterations Iter/call Iter/sec
19.88/19.98 c primal LP : 0.05 0 0 0.00 0.00
19.88/19.98 c dual LP : 3.94 458 22989 50.19 5834.77
19.88/19.98 c barrier LP : 0.00 0 0 0.00 -
19.88/19.98 c diving/probing LP: 0.00 0 0 0.00 -
19.88/19.98 c strong branching : 12.78 1187 48910 41.20 3827.07
19.88/19.98 c (at root node) : - 18 9570 531.67 -
19.88/19.98 c conflict analysis: 0.00 0 0 0.00 -
19.88/19.98 c B&B Tree :
19.88/19.98 c number of runs : 1
19.88/19.98 c nodes : 237
19.88/19.98 c nodes (total) : 237
19.88/19.98 c nodes left : 0
19.88/19.98 c max depth : 42
19.88/19.98 c max depth (total): 42
19.88/19.98 c backtracks : 44 (18.6%)
19.88/19.98 c delayed cutoffs : 12
19.88/19.98 c repropagations : 276 (5095 domain reductions, 1 cutoffs)
19.88/19.98 c avg switch length: 3.88
19.88/19.98 c switching time : 0.13
19.88/19.98 c Solution :
19.88/19.98 c Solutions found : 0 (0 improvements)
19.88/19.98 c Primal Bound : infeasible
19.88/19.98 c Dual Bound : -
19.88/19.98 c Gap : 0.00 %
19.88/19.98 c Root Dual Bound : +3.00000000000000e+01
19.98/20.01 c Time complete: 20.