0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2666116-1276453853.opb>
0.09/0.17 c original problem has 4354 variables (4354 bin, 0 int, 0 impl, 0 cont) and 8945 constraints
0.09/0.17 c problem read
0.09/0.17 c presolving settings loaded
0.19/0.24 c presolving:
0.39/0.45 c (round 1) 2752 del vars, 169 del conss, 8 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 174938 impls, 0 clqs
0.49/0.53 c (round 2) 2856 del vars, 4362 del conss, 92 chg bounds, 62 chg sides, 142 chg coeffs, 0 upgd conss, 179422 impls, 0 clqs
0.49/0.55 c (round 3) 2934 del vars, 4691 del conss, 175 chg bounds, 74 chg sides, 161 chg coeffs, 0 upgd conss, 182790 impls, 0 clqs
0.49/0.57 c (round 4) 3188 del vars, 5648 del conss, 372 chg bounds, 75 chg sides, 163 chg coeffs, 0 upgd conss, 186198 impls, 0 clqs
0.49/0.58 c (round 5) 3461 del vars, 6316 del conss, 551 chg bounds, 103 chg sides, 209 chg coeffs, 0 upgd conss, 187027 impls, 0 clqs
0.49/0.59 c (round 6) 3596 del vars, 6606 del conss, 630 chg bounds, 136 chg sides, 259 chg coeffs, 0 upgd conss, 187548 impls, 0 clqs
0.49/0.60 c (round 7) 3621 del vars, 6673 del conss, 645 chg bounds, 139 chg sides, 263 chg coeffs, 0 upgd conss, 187743 impls, 0 clqs
0.59/0.60 c (round 8) 3628 del vars, 6701 del conss, 649 chg bounds, 139 chg sides, 263 chg coeffs, 0 upgd conss, 187767 impls, 0 clqs
0.59/0.60 c (round 9) 3634 del vars, 6713 del conss, 651 chg bounds, 139 chg sides, 263 chg coeffs, 0 upgd conss, 187785 impls, 0 clqs
0.59/0.61 c (round 10) 3635 del vars, 6718 del conss, 652 chg bounds, 139 chg sides, 263 chg coeffs, 0 upgd conss, 187785 impls, 0 clqs
0.69/0.76 c (round 11) 3635 del vars, 6966 del conss, 652 chg bounds, 276 chg sides, 263 chg coeffs, 0 upgd conss, 187785 impls, 0 clqs
0.69/0.76 c (round 12) 3637 del vars, 6967 del conss, 652 chg bounds, 276 chg sides, 263 chg coeffs, 0 upgd conss, 187785 impls, 0 clqs
0.79/0.89 c (round 13) 3637 del vars, 6979 del conss, 652 chg bounds, 276 chg sides, 263 chg coeffs, 1798 upgd conss, 187785 impls, 0 clqs
0.89/0.91 c (round 14) 3637 del vars, 6979 del conss, 652 chg bounds, 276 chg sides, 263 chg coeffs, 1899 upgd conss, 187785 impls, 0 clqs
1.19/1.26 c (round 15) 3687 del vars, 6979 del conss, 654 chg bounds, 276 chg sides, 263 chg coeffs, 1899 upgd conss, 239567 impls, 0 clqs
1.19/1.27 c (round 16) 3690 del vars, 7007 del conss, 654 chg bounds, 276 chg sides, 263 chg coeffs, 1899 upgd conss, 239587 impls, 0 clqs
1.49/1.52 c (round 17) 3740 del vars, 7007 del conss, 654 chg bounds, 276 chg sides, 263 chg coeffs, 1899 upgd conss, 244715 impls, 0 clqs
1.49/1.52 c (round 18) 3743 del vars, 7043 del conss, 654 chg bounds, 276 chg sides, 263 chg coeffs, 1899 upgd conss, 244851 impls, 0 clqs
1.49/1.53 c (round 19) 3744 del vars, 7044 del conss, 654 chg bounds, 276 chg sides, 263 chg coeffs, 1899 upgd conss, 244851 impls, 0 clqs
1.59/1.61 c (round 20) 3788 del vars, 7044 del conss, 654 chg bounds, 276 chg sides, 263 chg coeffs, 1899 upgd conss, 245203 impls, 0 clqs
1.59/1.61 c (round 21) 3788 del vars, 7052 del conss, 654 chg bounds, 276 chg sides, 263 chg coeffs, 1899 upgd conss, 245203 impls, 0 clqs
1.59/1.62 c presolving (22 rounds):
1.59/1.62 c 3788 deleted vars, 7052 deleted constraints, 654 tightened bounds, 0 added holes, 276 changed sides, 263 changed coefficients
1.59/1.62 c 245203 implications, 0 cliques
1.59/1.62 c presolved problem has 566 variables (566 bin, 0 int, 0 impl, 0 cont) and 1893 constraints
1.59/1.62 c 79 constraints of type <linear>
1.59/1.62 c 1814 constraints of type <logicor>
1.59/1.62 c transformed objective value is always integral (scale: 1)
1.59/1.62 c Presolving Time: 1.32
1.59/1.62 c - non default parameters ----------------------------------------------------------------------
1.59/1.62 c # SCIP version 1.2.1.2
1.59/1.62 c
1.59/1.62 c # frequency for displaying node information lines
1.59/1.62 c # [type: int, range: [-1,2147483647], default: 100]
1.59/1.62 c display/freq = 10000
1.59/1.62 c
1.59/1.62 c # maximal time in seconds to run
1.59/1.62 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.59/1.62 c limits/time = 1799.84
1.59/1.62 c
1.59/1.62 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.59/1.62 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.59/1.62 c limits/memory = 1620
1.59/1.62 c
1.59/1.62 c # should presolving try to simplify inequalities
1.59/1.62 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.59/1.62 c constraints/linear/simplifyinequalities = TRUE
1.59/1.62 c
1.59/1.62 c # should presolving try to simplify knapsacks
1.59/1.62 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.59/1.62 c constraints/knapsack/simplifyinequalities = TRUE
1.59/1.62 c
1.59/1.62 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
1.59/1.62 c # [type: int, range: [-1,2147483647], default: -1]
1.59/1.62 c separating/rapidlearning/freq = 0
1.59/1.62 c
1.59/1.62 c -----------------------------------------------------------------------------------------------
1.59/1.62 c start solving
1.59/1.62 c
1.59/1.66 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.59/1.66 c 1.4s| 1 | 0 | 545 | - | 13M| 0 | 303 | 566 |1893 | 566 |1754 | 0 | 0 | 0 | 2.060250e+03 | -- | Inf
2.39/2.42 c 2.1s| 1 | 0 | 671 | - | 15M| 0 | 322 | 566 |1893 | 566 |3754 |2000 | 0 | 0 | 2.063000e+03 | -- | Inf
2.69/2.70 c 2.4s| 1 | 0 | 675 | - | 15M| 0 | - | 566 |1893 | 566 |3754 |2000 | 0 | 0 | -- | -- | 0.00%
2.69/2.70 c 2.4s| 1 | 0 | 675 | - | 15M| 0 | - | 566 |1893 | 566 |3754 |2000 | 0 | 0 | -- | -- | 0.00%
2.69/2.70 c
2.69/2.70 c SCIP Status : problem is solved [infeasible]
2.69/2.70 c Solving Time (sec) : 2.38
2.69/2.70 c Solving Nodes : 1
2.69/2.70 c Primal Bound : +1.00000000000000e+20 (0 solutions)
2.69/2.70 c Dual Bound : +1.00000000000000e+20
2.69/2.70 c Gap : 0.00 %
2.69/2.70 s UNSATISFIABLE
2.69/2.70 c SCIP Status : problem is solved [infeasible]
2.69/2.70 c Solving Time : 2.38
2.69/2.70 c Original Problem :
2.69/2.70 c Problem name : HOME/instance-2666116-1276453853.opb
2.69/2.70 c Variables : 4354 (4354 binary, 0 integer, 0 implicit integer, 0 continuous)
2.69/2.70 c Constraints : 8945 initial, 8945 maximal
2.69/2.70 c Presolved Problem :
2.69/2.70 c Problem name : t_HOME/instance-2666116-1276453853.opb
2.69/2.70 c Variables : 566 (566 binary, 0 integer, 0 implicit integer, 0 continuous)
2.69/2.70 c Constraints : 1893 initial, 1893 maximal
2.69/2.70 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.69/2.70 c trivial : 0.00 51 0 0 0 0 0 0 0
2.69/2.70 c dualfix : 0.00 136 0 0 0 0 0 0 0
2.69/2.70 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.69/2.70 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.69/2.70 c implics : 0.16 0 2756 0 0 0 0 0 0
2.69/2.70 c probing : 0.61 22 122 0 2 0 0 0 0
2.69/2.70 c linear : 0.32 610 91 0 652 0 6967 276 263
2.69/2.70 c logicor : 0.17 0 0 0 0 0 85 0 0
2.69/2.70 c root node : - 34 - - 34 - - - -
2.69/2.70 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.69/2.70 c integral : 0 0 0 0 0 0 0 0 0 0
2.69/2.70 c linear : 79 2 2682 0 0 0 0 0 0 0
2.69/2.70 c logicor : 1814 2 2579 0 0 7 0 0 0 0
2.69/2.70 c countsols : 0 0 0 0 0 0 0 0 0 0
2.69/2.70 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.69/2.70 c integral : 0.00 0.00 0.00 0.00 0.00
2.69/2.70 c linear : 0.03 0.00 0.03 0.00 0.00
2.69/2.70 c logicor : 0.12 0.00 0.12 0.00 0.00
2.69/2.70 c countsols : 0.00 0.00 0.00 0.00 0.00
2.69/2.70 c Propagators : Time Calls Cutoffs DomReds
2.69/2.70 c vbounds : 0.01 2 0 0
2.69/2.70 c rootredcost : 0.00 0 0 0
2.69/2.70 c pseudoobj : 0.00 3 0 0
2.69/2.70 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.69/2.70 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.69/2.70 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.69/2.70 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.69/2.70 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.69/2.70 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.69/2.70 c applied globally : - - - 0 0.0 - - -
2.69/2.70 c applied locally : - - - 0 0.0 - - -
2.69/2.70 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.69/2.70 c cut pool : 0.01 1 - - 0 - (maximal pool size: 3420)
2.69/2.70 c redcost : 0.00 2 0 0 0 0
2.69/2.70 c impliedbounds : 0.01 2 0 0 4558 0
2.69/2.70 c intobj : 0.00 0 0 0 0 0
2.69/2.70 c cgmip : 0.00 0 0 0 0 0
2.69/2.70 c gomory : 0.02 1 0 0 500 0
2.69/2.70 c strongcg : 0.03 1 0 0 500 0
2.69/2.70 c cmir : 0.03 1 0 0 0 0
2.69/2.70 c flowcover : 0.02 1 0 0 0 0
2.69/2.70 c clique : 0.05 1 0 0 7 0
2.69/2.70 c zerohalf : 0.00 0 0 0 0 0
2.69/2.70 c mcf : 0.00 1 0 0 0 0
2.69/2.70 c rapidlearning : 0.07 1 0 34 0 0
2.69/2.70 c Pricers : Time Calls Vars
2.69/2.70 c problem variables: 0.00 0 0
2.69/2.70 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.69/2.70 c pscost : 0.00 0 0 0 0 0 0
2.69/2.70 c inference : 0.00 0 0 0 0 0 0
2.69/2.70 c mostinf : 0.00 0 0 0 0 0 0
2.69/2.70 c leastinf : 0.00 0 0 0 0 0 0
2.69/2.70 c fullstrong : 0.00 0 0 0 0 0 0
2.69/2.70 c allfullstrong : 0.00 0 0 0 0 0 0
2.69/2.70 c random : 0.00 0 0 0 0 0 0
2.69/2.70 c relpscost : 0.00 0 0 0 0 0 0
2.69/2.70 c Primal Heuristics : Time Calls Found
2.69/2.70 c LP solutions : 0.00 - 0
2.69/2.70 c pseudo solutions : 0.00 - 0
2.69/2.70 c oneopt : 0.00 0 0
2.69/2.70 c trivial : 0.02 2 0
2.69/2.70 c simplerounding : 0.00 0 0
2.69/2.70 c zirounding : 0.00 0 0
2.69/2.70 c rounding : 0.00 2 0
2.69/2.70 c shifting : 0.00 2 0
2.69/2.70 c intshifting : 0.00 0 0
2.69/2.70 c twoopt : 0.00 0 0
2.69/2.70 c fixandinfer : 0.00 0 0
2.69/2.70 c feaspump : 0.02 1 0
2.69/2.70 c coefdiving : 0.00 0 0
2.69/2.70 c pscostdiving : 0.00 0 0
2.69/2.70 c fracdiving : 0.00 0 0
2.69/2.70 c veclendiving : 0.00 0 0
2.69/2.70 c intdiving : 0.00 0 0
2.69/2.70 c actconsdiving : 0.00 0 0
2.69/2.70 c objpscostdiving : 0.00 0 0
2.69/2.70 c rootsoldiving : 0.00 0 0
2.69/2.70 c linesearchdiving : 0.00 0 0
2.69/2.70 c guideddiving : 0.00 0 0
2.69/2.70 c octane : 0.00 0 0
2.69/2.70 c rens : 0.00 0 0
2.69/2.70 c rins : 0.00 0 0
2.69/2.70 c localbranching : 0.00 0 0
2.69/2.70 c mutation : 0.00 0 0
2.69/2.70 c crossover : 0.00 0 0
2.69/2.70 c dins : 0.00 0 0
2.69/2.70 c undercover : 0.00 0 0
2.69/2.70 c nlp : 0.00 0 0
2.69/2.70 c trysol : 0.00 0 0
2.69/2.70 c LP : Time Calls Iterations Iter/call Iter/sec
2.69/2.70 c primal LP : 0.00 0 0 0.00 -
2.69/2.70 c dual LP : 0.09 3 675 225.00 7500.00
2.69/2.70 c lex dual LP : 0.00 0 0 0.00 -
2.69/2.70 c barrier LP : 0.00 0 0 0.00 -
2.69/2.70 c diving/probing LP: 0.01 0 0 0.00 0.00
2.69/2.70 c strong branching : 0.00 0 0 0.00 -
2.69/2.70 c (at root node) : - 0 0 0.00 -
2.69/2.70 c conflict analysis: 0.00 0 0 0.00 -
2.69/2.70 c B&B Tree :
2.69/2.70 c number of runs : 1
2.69/2.70 c nodes : 1
2.69/2.70 c nodes (total) : 1
2.69/2.70 c nodes left : 0
2.69/2.70 c max depth : 0
2.69/2.70 c max depth (total): 0
2.69/2.70 c backtracks : 0 (0.0%)
2.69/2.70 c delayed cutoffs : 0
2.69/2.70 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.69/2.70 c avg switch length: 2.00
2.69/2.70 c switching time : 0.00
2.69/2.70 c Solution :
2.69/2.70 c Solutions found : 0 (0 improvements)
2.69/2.70 c Primal Bound : infeasible
2.69/2.70 c Dual Bound : -
2.69/2.70 c Gap : 0.00 %
2.69/2.70 c Root Dual Bound : -
2.69/2.70 c Root Iterations : 675
2.69/2.74 c Time complete: 2.73.