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-2666084-1276427829.opb>
0.09/0.10 c original problem has 2786 variables (2786 bin, 0 int, 0 impl, 0 cont) and 4827 constraints
0.09/0.10 c problem read
0.09/0.10 c presolving settings loaded
0.09/0.14 c presolving:
0.19/0.24 c (round 1) 2010 del vars, 514 del conss, 9 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 79634 impls, 0 clqs
0.19/0.27 c (round 2) 2087 del vars, 3105 del conss, 37 chg bounds, 12 chg sides, 36 chg coeffs, 0 upgd conss, 81605 impls, 0 clqs
0.19/0.28 c (round 3) 2124 del vars, 3266 del conss, 57 chg bounds, 12 chg sides, 36 chg coeffs, 0 upgd conss, 81723 impls, 0 clqs
0.19/0.28 c (round 4) 2133 del vars, 3304 del conss, 60 chg bounds, 12 chg sides, 36 chg coeffs, 0 upgd conss, 81765 impls, 0 clqs
0.19/0.29 c (round 5) 2139 del vars, 3318 del conss, 63 chg bounds, 12 chg sides, 36 chg coeffs, 0 upgd conss, 81765 impls, 0 clqs
0.19/0.29 c (round 6) 2140 del vars, 3319 del conss, 64 chg bounds, 12 chg sides, 36 chg coeffs, 0 upgd conss, 81765 impls, 0 clqs
0.29/0.37 c (round 7) 2140 del vars, 3399 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 0 upgd conss, 81769 impls, 0 clqs
0.29/0.37 c (round 8) 2142 del vars, 3400 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 0 upgd conss, 81769 impls, 0 clqs
0.39/0.44 c (round 9) 2142 del vars, 3435 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 1349 upgd conss, 81769 impls, 0 clqs
0.39/0.45 c (round 10) 2142 del vars, 3435 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 81769 impls, 0 clqs
0.49/0.50 c (round 11) 2192 del vars, 3435 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 84291 impls, 0 clqs
0.49/0.54 c (round 12) 2242 del vars, 3435 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 85359 impls, 0 clqs
0.49/0.54 c (round 13) 2242 del vars, 3458 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 85359 impls, 0 clqs
0.49/0.56 c (round 14) 2292 del vars, 3458 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 85633 impls, 0 clqs
0.49/0.56 c (round 15) 2293 del vars, 3483 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 85641 impls, 0 clqs
0.59/0.61 c (0.5s) probing: 613/642 (95.5%) - 22 fixings, 168 aggregations, 1515 implications, 0 bound changes
0.59/0.61 c (0.5s) probing aborted: 100/100 successive totally useless probings
0.59/0.61 c (round 16) 2333 del vars, 3483 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 85893 impls, 0 clqs
0.59/0.61 c (round 17) 2336 del vars, 3491 del conss, 66 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 85917 impls, 0 clqs
0.59/0.62 c (round 18) 2339 del vars, 3501 del conss, 66 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 85945 impls, 0 clqs
0.59/0.63 c (0.5s) probing: 623/642 (97.0%) - 22 fixings, 168 aggregations, 1515 implications, 0 bound changes
0.59/0.63 c (0.5s) probing aborted: 100/100 successive totally useless probings
0.59/0.63 c presolving (19 rounds):
0.59/0.63 c 2339 deleted vars, 3501 deleted constraints, 66 tightened bounds, 0 added holes, 88 changed sides, 36 changed coefficients
0.59/0.63 c 85945 implications, 0 cliques
0.59/0.63 c presolved problem has 445 variables (445 bin, 0 int, 0 impl, 0 cont) and 1326 constraints
0.59/0.63 c 1326 constraints of type <logicor>
0.59/0.63 c transformed objective value is always integral (scale: 1)
0.59/0.63 c Presolving Time: 0.46
0.59/0.63 c - non default parameters ----------------------------------------------------------------------
0.59/0.63 c # SCIP version 1.2.1.2
0.59/0.63 c
0.59/0.63 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.63 c conflict/interconss = 0
0.59/0.63 c
0.59/0.63 c # should binary conflicts be preferred?
0.59/0.63 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.63 c conflict/preferbinary = TRUE
0.59/0.63 c
0.59/0.63 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.63 c constraints/agelimit = 1
0.59/0.63 c
0.59/0.63 c # should enforcement of pseudo solution be disabled?
0.59/0.63 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.63 c constraints/disableenfops = TRUE
0.59/0.63 c
0.59/0.63 c # frequency for displaying node information lines
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 100]
0.59/0.63 c display/freq = 10000
0.59/0.63 c
0.59/0.63 c # maximal time in seconds to run
0.59/0.63 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.59/0.63 c limits/time = 1799.91
0.59/0.63 c
0.59/0.63 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.59/0.63 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.59/0.63 c limits/memory = 1620
0.59/0.63 c
0.59/0.63 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.63 c lp/solvefreq = 0
0.59/0.63 c
0.59/0.63 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.59/0.63 c # [type: char, range: {lafpsqd}, default: l]
0.59/0.63 c lp/pricing = a
0.59/0.63 c
0.59/0.63 c # should presolving try to simplify inequalities
0.59/0.63 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.63 c constraints/linear/simplifyinequalities = TRUE
0.59/0.63 c
0.59/0.63 c # should presolving try to simplify knapsacks
0.59/0.63 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.63 c constraints/knapsack/simplifyinequalities = TRUE
0.59/0.63 c
0.59/0.63 c # priority of node selection rule <dfs> in standard mode
0.59/0.63 c # [type: int, range: [-536870912,536870911], default: 0]
0.59/0.63 c nodeselection/dfs/stdpriority = 1000000
0.59/0.63 c
0.59/0.63 c -----------------------------------------------------------------------------------------------
0.59/0.63 c start solving
0.59/0.63 c
0.59/0.65 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.59/0.65 c 0.5s| 1 | 0 | 293 | - |8263k| 0 | 166 | 445 |1326 | 445 |1156 | 0 | 0 | 0 | 1.292417e+03 | -- | Inf
0.69/0.75 c 0.6s| 1 | 0 | 393 | - |8468k| 0 | 169 | 445 |1326 | 445 |1215 | 59 | 0 | 0 | 1.298500e+03 | -- | Inf
0.79/0.82 c 0.7s| 1 | 0 | 498 | - |8622k| 0 | 130 | 445 |1326 | 445 |1245 | 89 | 0 | 0 | 1.302000e+03 | -- | Inf
0.79/0.89 c 0.7s| 1 | 0 | 568 | - |8703k| 0 | 99 | 445 |1326 | 445 |1267 | 111 | 0 | 0 | 1.303000e+03 | -- | Inf
0.89/0.97 c 0.8s| 1 | 0 | 646 | - |8748k| 0 | 159 | 445 |1326 | 445 |1279 | 123 | 0 | 0 | 1.304200e+03 | -- | Inf
0.99/1.07 c 0.9s| 1 | 0 | 692 | - |8984k| 0 | 166 | 445 |1326 | 445 |1294 | 138 | 0 | 0 | 1.305500e+03 | -- | Inf
1.19/1.22 c 1.1s| 1 | 0 | 827 | - |9304k| 0 | 138 | 445 |1326 | 445 |1313 | 157 | 0 | 0 | 1.306000e+03 | -- | Inf
1.29/1.38 c 1.2s| 1 | 0 | 956 | - |9344k| 0 | 133 | 445 |1326 | 445 |1323 | 167 | 0 | 0 | 1.306500e+03 | -- | Inf
1.49/1.57 c 1.4s| 1 | 0 | 1163 | - |9427k| 0 | 139 | 445 |1326 | 445 |1338 | 182 | 0 | 0 | 1.307000e+03 | -- | Inf
1.69/1.79 c 1.6s| 1 | 0 | 1355 | - |9829k| 0 | 138 | 445 |1326 | 445 |1349 | 193 | 0 | 0 | 1.308250e+03 | -- | Inf
1.79/1.89 c 1.7s| 1 | 0 | 1407 | - | 10M| 0 | 132 | 445 |1326 | 445 |1360 | 204 | 0 | 0 | 1.309333e+03 | -- | Inf
1.99/2.06 c 1.9s| 1 | 0 | 1519 | - | 10M| 0 | 172 | 445 |1326 | 445 |1326 | 211 | 0 | 0 | 1.310333e+03 | -- | Inf
2.20/2.28 c 2.1s| 1 | 0 | 1620 | - | 11M| 0 | 148 | 445 |1326 | 445 |1338 | 223 | 0 | 0 | 1.311000e+03 | -- | Inf
2.39/2.47 c 2.3s| 1 | 0 | 1798 | - | 11M| 0 | 145 | 445 |1326 | 445 |1347 | 232 | 0 | 0 | 1.311000e+03 | -- | Inf
2.49/2.58 c 2.4s| 1 | 0 | 1923 | - | 11M| 0 | 178 | 445 |1326 | 445 |1360 | 245 | 0 | 0 | 1.311250e+03 | -- | Inf
2.69/2.72 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.69/2.72 c 2.5s| 1 | 0 | 2080 | - | 11M| 0 | 194 | 445 |1326 | 445 |1376 | 261 | 0 | 0 | 1.311750e+03 | -- | Inf
2.89/2.99 c 2.8s| 1 | 0 | 2239 | - | 12M| 0 | 192 | 445 |1326 | 445 |1390 | 275 | 0 | 0 | 1.312500e+03 | -- | Inf
3.09/3.15 c 2.9s| 1 | 0 | 2388 | - | 12M| 0 | 187 | 445 |1326 | 445 |1337 | 291 | 0 | 0 | 1.313340e+03 | -- | Inf
3.39/3.42 c 3.2s| 1 | 0 | 2694 | - | 13M| 0 | 183 | 445 |1326 | 445 |1349 | 303 | 0 | 0 | 1.314030e+03 | -- | Inf
3.49/3.56 c 3.3s| 1 | 0 | 2842 | - | 13M| 0 | 187 | 445 |1326 | 445 |1370 | 324 | 0 | 0 | 1.314861e+03 | -- | Inf
3.79/3.82 c 3.6s| 1 | 0 | 3025 | - | 13M| 0 | 222 | 445 |1326 | 445 |1394 | 348 | 0 | 0 | 1.315485e+03 | -- | Inf
3.99/4.00 c 3.8s| 1 | 0 | 3207 | - | 13M| 0 | 229 | 445 |1326 | 445 |1406 | 360 | 0 | 0 | 1.316464e+03 | -- | Inf
4.19/4.24 c 4.0s| 1 | 0 | 3407 | - | 13M| 0 | 205 | 445 |1326 | 445 |1418 | 372 | 0 | 0 | 1.317000e+03 | -- | Inf
4.39/4.42 c 4.2s| 1 | 0 | 3472 | - | 13M| 0 | 222 | 445 |1326 | 445 |1384 | 383 | 0 | 0 | 1.317000e+03 | -- | Inf
4.59/4.65 c 4.4s| 1 | 0 | 3698 | - | 13M| 0 | 215 | 445 |1326 | 445 |1395 | 394 | 0 | 0 | 1.317000e+03 | -- | Inf
4.79/4.84 c 4.6s| 1 | 0 | 3837 | - | 13M| 0 | 248 | 445 |1326 | 445 |1409 | 408 | 0 | 0 | 1.317000e+03 | -- | Inf
4.98/5.09 c 4.8s| 1 | 0 | 3944 | - | 13M| 0 | 237 | 445 |1326 | 445 |1417 | 416 | 0 | 0 | 1.317000e+03 | -- | Inf
5.29/5.33 c 5.1s| 1 | 0 | 3976 | - | 13M| 0 | 223 | 445 |1326 | 445 |1423 | 422 | 0 | 0 | 1.317000e+03 | -- | Inf
8.38/8.44 c 8.1s| 1 | 0 | 3976 | - | 13M| 0 | - | 445 |1300 | 445 |1423 | 422 | 0 | 39 | -- | -- | 0.00%
8.38/8.44 c
8.38/8.44 c SCIP Status : problem is solved [infeasible]
8.38/8.44 c Solving Time (sec) : 8.14
8.38/8.44 c Solving Nodes : 1
8.38/8.44 c Primal Bound : +1.00000000000000e+20 (0 solutions)
8.38/8.44 c Dual Bound : +1.00000000000000e+20
8.38/8.44 c Gap : 0.00 %
8.38/8.44 s UNSATISFIABLE
8.38/8.44 c SCIP Status : problem is solved [infeasible]
8.38/8.44 c Solving Time : 8.14
8.38/8.44 c Original Problem :
8.38/8.44 c Problem name : HOME/instance-2666084-1276427829.opb
8.38/8.44 c Variables : 2786 (2786 binary, 0 integer, 0 implicit integer, 0 continuous)
8.38/8.44 c Constraints : 4827 initial, 4827 maximal
8.38/8.44 c Presolved Problem :
8.38/8.44 c Problem name : t_HOME/instance-2666084-1276427829.opb
8.38/8.44 c Variables : 445 (445 binary, 0 integer, 0 implicit integer, 0 continuous)
8.38/8.44 c Constraints : 1326 initial, 1326 maximal
8.38/8.44 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
8.38/8.44 c trivial : 0.00 4 0 0 0 0 0 0 0
8.38/8.44 c dualfix : 0.00 25 0 0 0 0 0 0 0
8.38/8.44 c boundshift : 0.00 0 0 0 0 0 0 0 0
8.38/8.44 c inttobinary : 0.00 0 0 0 0 0 0 0 0
8.38/8.44 c implics : 0.06 0 1671 0 0 0 0 0 0
8.38/8.44 c probing : 0.12 22 168 0 0 0 0 0 0
8.38/8.44 c linear : 0.15 64 385 0 64 0 3400 88 36
8.38/8.44 c logicor : 0.10 0 0 0 2 0 101 0 0
8.38/8.44 c root node : - 17 - - 17 - - - -
8.38/8.44 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
8.38/8.44 c integral : 0 0 0 1 0 0 4 0 0 0
8.38/8.44 c logicor : 1326 27 1787 0 0 12 13 0 0 0
8.38/8.44 c countsols : 0 0 0 0 0 0 0 0 0 0
8.38/8.44 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
8.38/8.44 c integral : 3.05 0.00 0.00 3.05 0.00
8.38/8.44 c logicor : 0.05 0.03 0.02 0.00 0.00
8.38/8.44 c countsols : 0.00 0.00 0.00 0.00 0.00
8.38/8.44 c Propagators : Time Calls Cutoffs DomReds
8.38/8.44 c vbounds : 0.00 2 0 0
8.38/8.44 c rootredcost : 0.00 0 0 0
8.38/8.44 c pseudoobj : 0.01 24 0 0
8.38/8.44 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
8.38/8.44 c propagation : 0.00 1 0 0 0.0 0 0.0 -
8.38/8.44 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
8.38/8.44 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
8.38/8.44 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
8.38/8.44 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
8.38/8.44 c applied globally : - - - 0 0.0 - - -
8.38/8.44 c applied locally : - - - 0 0.0 - - -
8.38/8.44 c Separators : Time Calls Cutoffs DomReds Cuts Conss
8.38/8.44 c cut pool : 0.04 26 - - 302 - (maximal pool size: 2756)
8.38/8.44 c redcost : 0.00 27 0 0 0 0
8.38/8.44 c impliedbounds : 0.00 27 0 0 173 0
8.38/8.44 c intobj : 0.00 0 0 0 0 0
8.38/8.44 c cgmip : 0.00 0 0 0 0 0
8.38/8.44 c gomory : 2.10 27 0 0 9756 0
8.38/8.44 c strongcg : 0.95 20 0 0 9184 0
8.38/8.44 c cmir : 0.10 10 0 0 0 0
8.38/8.44 c flowcover : 0.10 10 0 0 0 0
8.38/8.44 c clique : 0.01 27 0 0 143 0
8.38/8.44 c zerohalf : 0.00 0 0 0 0 0
8.38/8.44 c mcf : 0.00 1 0 0 0 0
8.38/8.44 c rapidlearning : 0.00 0 0 0 0 0
8.38/8.44 c Pricers : Time Calls Vars
8.38/8.44 c problem variables: 0.00 0 0
8.38/8.44 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
8.38/8.44 c relpscost : 3.05 1 0 4 0 0 0
8.38/8.44 c pscost : 0.00 0 0 0 0 0 0
8.38/8.44 c inference : 0.00 0 0 0 0 0 0
8.38/8.44 c mostinf : 0.00 0 0 0 0 0 0
8.38/8.44 c leastinf : 0.00 0 0 0 0 0 0
8.38/8.44 c fullstrong : 0.00 0 0 0 0 0 0
8.38/8.44 c allfullstrong : 0.00 0 0 0 0 0 0
8.38/8.44 c random : 0.00 0 0 0 0 0 0
8.38/8.44 c Primal Heuristics : Time Calls Found
8.38/8.44 c LP solutions : 0.00 - 0
8.38/8.44 c pseudo solutions : 0.00 - 0
8.38/8.44 c oneopt : 0.00 0 0
8.38/8.44 c crossover : 0.00 0 0
8.38/8.44 c trivial : 0.00 2 0
8.38/8.44 c simplerounding : 0.00 0 0
8.38/8.44 c zirounding : 0.00 1 0
8.38/8.44 c rounding : 0.00 28 0
8.38/8.44 c shifting : 0.03 28 0
8.38/8.44 c intshifting : 0.00 0 0
8.38/8.44 c twoopt : 0.00 0 0
8.38/8.44 c fixandinfer : 0.00 0 0
8.38/8.44 c feaspump : 0.01 1 0
8.38/8.44 c coefdiving : 0.00 0 0
8.38/8.44 c pscostdiving : 0.00 0 0
8.38/8.44 c fracdiving : 0.00 0 0
8.38/8.44 c veclendiving : 0.00 0 0
8.38/8.44 c intdiving : 0.00 0 0
8.38/8.44 c actconsdiving : 0.00 0 0
8.38/8.44 c objpscostdiving : 0.00 0 0
8.38/8.44 c rootsoldiving : 0.00 0 0
8.38/8.44 c linesearchdiving : 0.00 0 0
8.38/8.44 c guideddiving : 0.00 0 0
8.38/8.44 c octane : 0.00 0 0
8.38/8.44 c rens : 0.00 0 0
8.38/8.44 c rins : 0.00 0 0
8.38/8.44 c localbranching : 0.00 0 0
8.38/8.44 c mutation : 0.00 0 0
8.38/8.44 c dins : 0.00 0 0
8.38/8.44 c undercover : 0.00 0 0
8.38/8.44 c nlp : 0.00 0 0
8.38/8.44 c trysol : 0.00 0 0
8.38/8.44 c LP : Time Calls Iterations Iter/call Iter/sec
8.38/8.44 c primal LP : 0.02 0 0 0.00 0.00
8.38/8.44 c dual LP : 1.10 28 3976 142.00 3614.55
8.38/8.44 c lex dual LP : 0.00 0 0 0.00 -
8.38/8.44 c barrier LP : 0.00 0 0 0.00 -
8.38/8.44 c diving/probing LP: 0.00 0 0 0.00 -
8.38/8.44 c strong branching : 3.05 39 9560 245.13 3134.43
8.38/8.44 c (at root node) : - 39 9560 245.13 -
8.38/8.44 c conflict analysis: 0.00 0 0 0.00 -
8.38/8.44 c B&B Tree :
8.38/8.44 c number of runs : 1
8.38/8.44 c nodes : 1
8.38/8.44 c nodes (total) : 1
8.38/8.44 c nodes left : 0
8.38/8.44 c max depth : 0
8.38/8.44 c max depth (total): 0
8.38/8.44 c backtracks : 0 (0.0%)
8.38/8.44 c delayed cutoffs : 0
8.38/8.44 c repropagations : 0 (0 domain reductions, 0 cutoffs)
8.38/8.44 c avg switch length: 2.00
8.38/8.44 c switching time : 0.00
8.38/8.44 c Solution :
8.38/8.44 c Solutions found : 0 (0 improvements)
8.38/8.44 c Primal Bound : infeasible
8.38/8.44 c Dual Bound : -
8.38/8.44 c Gap : 0.00 %
8.38/8.44 c Root Dual Bound : -
8.38/8.44 c Root Iterations : 3976
8.38/8.47 c Time complete: 8.47.