0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2704361-1278553838.opb>
0.06/0.09 c original problem has 2786 variables (2786 bin, 0 int, 0 impl, 0 cont) and 4827 constraints
0.06/0.09 c problem read
0.06/0.09 c presolving settings loaded
0.09/0.13 c presolving:
0.19/0.23 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.26 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.26 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.26 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.27 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.27 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.35 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.35 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.29/0.37 c (round 9) 2142 del vars, 3401 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 1349 upgd conss, 81769 impls, 0 clqs
0.29/0.38 c (round 10) 2142 del vars, 3401 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 81769 impls, 0 clqs
0.39/0.44 c (round 11) 2192 del vars, 3401 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 84481 impls, 0 clqs
0.39/0.44 c (round 12) 2192 del vars, 3452 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 84481 impls, 0 clqs
0.39/0.45 c (round 13) 2192 del vars, 3456 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 84481 impls, 0 clqs
0.39/0.48 c (round 14) 2242 del vars, 3456 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 85379 impls, 0 clqs
0.39/0.48 c (round 15) 2242 del vars, 3514 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 85379 impls, 0 clqs
0.39/0.49 c (round 16) 2242 del vars, 3530 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 85379 impls, 0 clqs
0.49/0.51 c (round 17) 2292 del vars, 3530 del conss, 66 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 85577 impls, 0 clqs
0.49/0.52 c (round 18) 2295 del vars, 3589 del conss, 66 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 85601 impls, 0 clqs
0.49/0.52 c (round 19) 2295 del vars, 3591 del conss, 66 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 85601 impls, 0 clqs
0.49/0.53 c (round 20) 2295 del vars, 3610 del conss, 66 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 85601 impls, 0 clqs
0.69/0.76 c (0.5s) probing: 613/642 (95.5%) - 23 fixings, 166 aggregations, 1496 implications, 2 bound changes
0.69/0.76 c (0.5s) probing aborted: 100/100 successive totally useless probings
0.69/0.76 c (round 21) 2334 del vars, 3610 del conss, 66 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 85945 impls, 0 clqs
0.69/0.76 c (round 22) 2338 del vars, 3650 del conss, 67 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 85996 impls, 0 clqs
0.69/0.76 c (round 23) 2339 del vars, 3658 del conss, 67 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 85996 impls, 0 clqs
0.69/0.76 c (round 24) 2339 del vars, 3662 del conss, 67 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 85996 impls, 0 clqs
0.69/0.76 c (0.5s) probing: 623/642 (97.0%) - 23 fixings, 166 aggregations, 1496 implications, 2 bound changes
0.69/0.76 c (0.5s) probing aborted: 100/100 successive totally useless probings
0.69/0.76 c presolving (25 rounds):
0.69/0.76 c 2339 deleted vars, 3662 deleted constraints, 67 tightened bounds, 0 added holes, 88 changed sides, 36 changed coefficients
0.69/0.76 c 85996 implications, 0 cliques
0.69/0.77 c presolved problem has 445 variables (445 bin, 0 int, 0 impl, 0 cont) and 1165 constraints
0.69/0.77 c 607 constraints of type <setppc>
0.69/0.77 c 558 constraints of type <logicor>
0.69/0.77 c transformed objective value is always integral (scale: 1)
0.69/0.77 c Presolving Time: 0.47
0.69/0.77 c - non default parameters ----------------------------------------------------------------------
0.69/0.77 c # SCIP version 1.2.1.3
0.69/0.77 c
0.69/0.77 c # frequency for displaying node information lines
0.69/0.77 c # [type: int, range: [-1,2147483647], default: 100]
0.69/0.77 c display/freq = 10000
0.69/0.77 c
0.69/0.77 c # maximal time in seconds to run
0.69/0.77 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.69/0.77 c limits/time = 1789.92
0.69/0.77 c
0.69/0.77 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.69/0.77 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.69/0.77 c limits/memory = 1620
0.69/0.77 c
0.69/0.77 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.69/0.77 c # [type: int, range: [1,2], default: 1]
0.69/0.77 c timing/clocktype = 2
0.69/0.77 c
0.69/0.77 c # should presolving try to simplify inequalities
0.69/0.77 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.77 c constraints/linear/simplifyinequalities = TRUE
0.69/0.77 c
0.69/0.77 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.69/0.77 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.77 c constraints/indicator/addCouplingCons = TRUE
0.69/0.77 c
0.69/0.77 c # should presolving try to simplify knapsacks
0.69/0.77 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.69/0.77 c constraints/knapsack/simplifyinequalities = TRUE
0.69/0.77 c
0.69/0.77 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.69/0.77 c # [type: int, range: [-1,2147483647], default: -1]
0.69/0.77 c separating/rapidlearning/freq = 0
0.69/0.77 c
0.69/0.77 c -----------------------------------------------------------------------------------------------
0.69/0.77 c start solving
0.69/0.77 c
0.69/0.77 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.69/0.77 c 0.5s| 1 | 0 | 342 | - |8064k| 0 | 174 | 445 |1165 | 445 |1146 | 0 | 0 | 0 | 1.292417e+03 | -- | Inf
0.89/0.95 c 0.9s| 1 | 0 | 2257 | - |8266k| 0 | - | 445 |1165 | 445 |1146 | 0 | 0 | 0 | -- | -- | 0.00%
0.89/0.95 c 0.9s| 1 | 0 | 2257 | - |8266k| 0 | - | 445 |1165 | 445 |1146 | 0 | 0 | 0 | -- | -- | 0.00%
0.89/0.95 c
0.89/0.95 c SCIP Status : problem is solved [infeasible]
0.89/0.95 c Solving Time (sec) : 0.86
0.89/0.95 c Solving Nodes : 1
0.89/0.95 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.89/0.95 c Dual Bound : +1.00000000000000e+20
0.89/0.95 c Gap : 0.00 %
0.89/0.95 s UNSATISFIABLE
0.89/0.95 c SCIP Status : problem is solved [infeasible]
0.89/0.95 c Solving Time : 0.86
0.89/0.95 c Original Problem :
0.89/0.95 c Problem name : HOME/instance-2704361-1278553838.opb
0.89/0.95 c Variables : 2786 (2786 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.95 c Constraints : 4827 initial, 4827 maximal
0.89/0.95 c Presolved Problem :
0.89/0.95 c Problem name : t_HOME/instance-2704361-1278553838.opb
0.89/0.95 c Variables : 445 (445 binary, 0 integer, 0 implicit integer, 0 continuous)
0.89/0.95 c Constraints : 1165 initial, 1165 maximal
0.89/0.95 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.89/0.95 c trivial : 0.00 3 0 0 0 0 0 0 0
0.89/0.95 c dualfix : 0.00 25 0 0 0 0 0 0 0
0.89/0.95 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.89/0.95 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.89/0.95 c implics : 0.07 0 1673 0 0 0 0 0 0
0.89/0.95 c probing : 0.14 23 166 0 2 0 0 0 0
0.89/0.95 c setppc : 0.04 0 0 0 0 0 231 0 0
0.89/0.95 c linear : 0.15 64 385 0 64 0 3400 88 36
0.89/0.95 c logicor : 0.02 0 0 0 1 0 31 0 0
0.89/0.95 c root node : - 20 - - 20 - - - -
0.89/0.95 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.89/0.95 c integral : 0 0 0 0 0 0 0 0 0 0
0.89/0.95 c setppc : 607 1 1695 0 0 0 0 0 0 0
0.89/0.95 c logicor : 558 1 1365 0 0 9 0 0 0 0
0.89/0.95 c countsols : 0 0 0 0 0 0 0 0 0 0
0.89/0.95 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.89/0.95 c integral : 0.00 0.00 0.00 0.00 0.00
0.89/0.95 c setppc : 0.04 0.00 0.04 0.00 0.00
0.89/0.95 c logicor : 0.01 0.00 0.01 0.00 0.00
0.89/0.95 c countsols : 0.00 0.00 0.00 0.00 0.00
0.89/0.95 c Propagators : Time Calls Cutoffs DomReds
0.89/0.95 c vbounds : 0.00 2 0 0
0.89/0.95 c rootredcost : 0.00 0 0 0
0.89/0.95 c pseudoobj : 0.00 2 0 0
0.89/0.95 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.89/0.95 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.89/0.95 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.95 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.95 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.95 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.89/0.95 c applied globally : - - - 0 0.0 - - -
0.89/0.95 c applied locally : - - - 0 0.0 - - -
0.89/0.95 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.89/0.95 c cut pool : 0.00 0 - - 0 - (maximal pool size: 153)
0.89/0.95 c redcost : 0.00 1 0 0 0 0
0.89/0.95 c impliedbounds : 0.00 1 0 0 24 0
0.89/0.95 c intobj : 0.00 0 0 0 0 0
0.89/0.95 c cgmip : 0.00 0 0 0 0 0
0.89/0.95 c gomory : 0.02 1 0 0 500 0
0.89/0.95 c strongcg : 0.02 1 0 0 500 0
0.89/0.95 c cmir : 0.01 1 0 0 0 0
0.89/0.95 c flowcover : 0.01 1 0 0 0 0
0.89/0.95 c clique : 0.00 1 0 0 6 0
0.89/0.95 c zerohalf : 0.00 0 0 0 0 0
0.89/0.95 c mcf : 0.00 1 0 0 0 0
0.89/0.95 c rapidlearning : 0.07 1 0 20 0 0
0.89/0.95 c Pricers : Time Calls Vars
0.89/0.95 c problem variables: 0.00 0 0
0.89/0.95 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.89/0.95 c pscost : 0.00 0 0 0 0 0 0
0.89/0.95 c inference : 0.00 0 0 0 0 0 0
0.89/0.95 c mostinf : 0.00 0 0 0 0 0 0
0.89/0.95 c leastinf : 0.00 0 0 0 0 0 0
0.89/0.95 c fullstrong : 0.00 0 0 0 0 0 0
0.89/0.95 c allfullstrong : 0.00 0 0 0 0 0 0
0.89/0.95 c random : 0.00 0 0 0 0 0 0
0.89/0.95 c relpscost : 0.00 0 0 0 0 0 0
0.89/0.95 c Primal Heuristics : Time Calls Found
0.89/0.95 c LP solutions : 0.00 - 0
0.89/0.95 c pseudo solutions : 0.00 - 0
0.89/0.95 c oneopt : 0.00 0 0
0.89/0.95 c trivial : 0.01 2 0
0.89/0.95 c simplerounding : 0.00 0 0
0.89/0.95 c zirounding : 0.00 0 0
0.89/0.95 c rounding : 0.00 1 0
0.89/0.95 c shifting : 0.00 1 0
0.89/0.95 c intshifting : 0.00 0 0
0.89/0.95 c twoopt : 0.00 0 0
0.89/0.95 c fixandinfer : 0.00 0 0
0.89/0.95 c feaspump : 0.20 1 0
0.89/0.95 c coefdiving : 0.00 0 0
0.89/0.95 c pscostdiving : 0.00 0 0
0.89/0.95 c fracdiving : 0.00 0 0
0.89/0.95 c veclendiving : 0.00 0 0
0.89/0.95 c intdiving : 0.00 0 0
0.89/0.95 c actconsdiving : 0.00 0 0
0.89/0.95 c objpscostdiving : 0.00 0 0
0.89/0.96 c rootsoldiving : 0.00 0 0
0.89/0.96 c linesearchdiving : 0.00 0 0
0.89/0.96 c guideddiving : 0.00 0 0
0.89/0.96 c octane : 0.00 0 0
0.89/0.96 c rens : 0.00 0 0
0.89/0.96 c rins : 0.00 0 0
0.89/0.96 c localbranching : 0.00 0 0
0.89/0.96 c mutation : 0.00 0 0
0.89/0.96 c crossover : 0.00 0 0
0.89/0.96 c dins : 0.00 0 0
0.89/0.96 c undercover : 0.00 0 0
0.89/0.96 c nlp : 0.00 0 0
0.89/0.96 c trysol : 0.00 0 0
0.89/0.96 c LP : Time Calls Iterations Iter/call Iter/sec
0.89/0.96 c primal LP : 0.00 0 0 0.00 -
0.89/0.96 c dual LP : 0.02 2 355 177.50 14791.67
0.89/0.96 c lex dual LP : 0.00 0 0 0.00 -
0.89/0.96 c barrier LP : 0.00 0 0 0.00 -
0.89/0.96 c diving/probing LP: 0.18 32 1902 59.44 10393.61
0.89/0.96 c strong branching : 0.00 0 0 0.00 -
0.89/0.96 c (at root node) : - 0 0 0.00 -
0.89/0.96 c conflict analysis: 0.00 0 0 0.00 -
0.89/0.96 c B&B Tree :
0.89/0.96 c number of runs : 1
0.89/0.96 c nodes : 1
0.89/0.96 c nodes (total) : 1
0.89/0.96 c nodes left : 0
0.89/0.96 c max depth : 0
0.89/0.96 c max depth (total): 0
0.89/0.96 c backtracks : 0 (0.0%)
0.89/0.96 c delayed cutoffs : 0
0.89/0.96 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.89/0.96 c avg switch length: 2.00
0.89/0.96 c switching time : 0.00
0.89/0.96 c Solution :
0.89/0.96 c Solutions found : 0 (0 improvements)
0.89/0.96 c Primal Bound : infeasible
0.89/0.96 c Dual Bound : -
0.89/0.96 c Gap : 0.00 %
0.89/0.96 c Root Dual Bound : -
0.89/0.96 c Root Iterations : 2257
0.89/0.98 c Time complete: 0.97.