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-2704395-1278554201.opb>
0.00/0.06 c original problem has 1972 variables (1972 bin, 0 int, 0 impl, 0 cont) and 3301 constraints
0.00/0.06 c problem read
0.00/0.06 c presolving settings loaded
0.07/0.09 c presolving:
0.19/0.22 c (round 1) 1536 del vars, 575 del conss, 7 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 83932 impls, 0 clqs
0.19/0.24 c (round 2) 1542 del vars, 2258 del conss, 12 chg bounds, 6 chg sides, 15 chg coeffs, 0 upgd conss, 84330 impls, 0 clqs
0.19/0.24 c (round 3) 1543 del vars, 2264 del conss, 12 chg bounds, 6 chg sides, 15 chg coeffs, 0 upgd conss, 84330 impls, 0 clqs
0.19/0.28 c (round 4) 1543 del vars, 2306 del conss, 12 chg bounds, 48 chg sides, 15 chg coeffs, 0 upgd conss, 84330 impls, 0 clqs
0.19/0.29 c (round 5) 1543 del vars, 2306 del conss, 12 chg bounds, 48 chg sides, 15 chg coeffs, 938 upgd conss, 84330 impls, 0 clqs
0.29/0.30 c (round 6) 1543 del vars, 2306 del conss, 12 chg bounds, 48 chg sides, 15 chg coeffs, 995 upgd conss, 84330 impls, 0 clqs
0.29/0.35 c (round 7) 1593 del vars, 2306 del conss, 12 chg bounds, 48 chg sides, 15 chg coeffs, 995 upgd conss, 88700 impls, 0 clqs
0.29/0.36 c (round 8) 1593 del vars, 2342 del conss, 12 chg bounds, 48 chg sides, 15 chg coeffs, 995 upgd conss, 88700 impls, 0 clqs
0.29/0.36 c (round 9) 1593 del vars, 2386 del conss, 12 chg bounds, 48 chg sides, 15 chg coeffs, 995 upgd conss, 88700 impls, 0 clqs
0.29/0.40 c (round 10) 1643 del vars, 2386 del conss, 12 chg bounds, 48 chg sides, 15 chg coeffs, 995 upgd conss, 89476 impls, 0 clqs
0.39/0.40 c (round 11) 1643 del vars, 2430 del conss, 12 chg bounds, 48 chg sides, 15 chg coeffs, 995 upgd conss, 89476 impls, 0 clqs
0.39/0.40 c (round 12) 1643 del vars, 2441 del conss, 12 chg bounds, 48 chg sides, 15 chg coeffs, 995 upgd conss, 89476 impls, 0 clqs
0.39/0.42 c (round 13) 1671 del vars, 2441 del conss, 12 chg bounds, 48 chg sides, 15 chg coeffs, 995 upgd conss, 89600 impls, 0 clqs
0.39/0.42 c (round 14) 1671 del vars, 2465 del conss, 12 chg bounds, 48 chg sides, 15 chg coeffs, 995 upgd conss, 89600 impls, 0 clqs
0.39/0.42 c (round 15) 1671 del vars, 2473 del conss, 12 chg bounds, 48 chg sides, 15 chg coeffs, 995 upgd conss, 89600 impls, 0 clqs
0.39/0.43 c presolving (16 rounds):
0.39/0.43 c 1671 deleted vars, 2473 deleted constraints, 12 tightened bounds, 0 added holes, 48 changed sides, 15 changed coefficients
0.39/0.43 c 89600 implications, 0 cliques
0.39/0.43 c presolved problem has 301 variables (301 bin, 0 int, 0 impl, 0 cont) and 828 constraints
0.39/0.43 c 450 constraints of type <setppc>
0.39/0.43 c 378 constraints of type <logicor>
0.39/0.43 c transformed objective value is always integral (scale: 1)
0.39/0.43 c Presolving Time: 0.35
0.39/0.43 c - non default parameters ----------------------------------------------------------------------
0.39/0.43 c # SCIP version 1.2.1.3
0.39/0.43 c
0.39/0.43 c # frequency for displaying node information lines
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 100]
0.39/0.43 c display/freq = 10000
0.39/0.43 c
0.39/0.43 c # maximal time in seconds to run
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.43 c limits/time = 1789.95
0.39/0.43 c
0.39/0.43 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.43 c limits/memory = 1620
0.39/0.43 c
0.39/0.43 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.39/0.43 c # [type: int, range: [1,2], default: 1]
0.39/0.43 c timing/clocktype = 2
0.39/0.43 c
0.39/0.43 c # should presolving try to simplify inequalities
0.39/0.43 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.43 c constraints/linear/simplifyinequalities = TRUE
0.39/0.43 c
0.39/0.43 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.39/0.43 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.43 c constraints/indicator/addCouplingCons = TRUE
0.39/0.43 c
0.39/0.43 c # should presolving try to simplify knapsacks
0.39/0.43 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.43 c constraints/knapsack/simplifyinequalities = TRUE
0.39/0.43 c
0.39/0.43 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.43 c separating/rapidlearning/freq = 0
0.39/0.43 c
0.39/0.43 c -----------------------------------------------------------------------------------------------
0.39/0.43 c start solving
0.39/0.43 c
0.39/0.44 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.44 c 0.4s| 1 | 0 | 198 | - |5726k| 0 | 96 | 301 | 828 | 301 | 826 | 0 | 0 | 0 | 9.265000e+02 | -- | Inf
0.79/0.84 c 0.8s| 1 | 0 | 849 | - |5832k| 0 | - | 301 |1034 | 301 | 826 | 0 | 0 | 0 | -- | -- | 0.00%
0.79/0.84 c 0.8s| 1 | 0 | 849 | - |5832k| 0 | - | 301 |1034 | 301 | 826 | 0 | 0 | 0 | -- | -- | 0.00%
0.79/0.84 c
0.79/0.84 c SCIP Status : problem is solved [infeasible]
0.79/0.84 c Solving Time (sec) : 0.78
0.79/0.84 c Solving Nodes : 1
0.79/0.84 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.79/0.84 c Dual Bound : +1.00000000000000e+20
0.79/0.84 c Gap : 0.00 %
0.79/0.84 s UNSATISFIABLE
0.79/0.84 c SCIP Status : problem is solved [infeasible]
0.79/0.84 c Solving Time : 0.78
0.79/0.84 c Original Problem :
0.79/0.84 c Problem name : HOME/instance-2704395-1278554201.opb
0.79/0.84 c Variables : 1972 (1972 binary, 0 integer, 0 implicit integer, 0 continuous)
0.79/0.84 c Constraints : 3301 initial, 3301 maximal
0.79/0.84 c Presolved Problem :
0.79/0.84 c Problem name : t_HOME/instance-2704395-1278554201.opb
0.79/0.84 c Variables : 301 (301 binary, 0 integer, 0 implicit integer, 0 continuous)
0.79/0.84 c Constraints : 828 initial, 1034 maximal
0.79/0.84 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.79/0.84 c trivial : 0.00 0 0 0 0 0 0 0 0
0.79/0.84 c dualfix : 0.00 2 0 0 0 0 0 0 0
0.79/0.84 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.79/0.84 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.79/0.84 c implics : 0.11 0 1116 0 0 0 0 0 0
0.79/0.84 c probing : 0.11 2 126 0 0 0 0 0 0
0.79/0.84 c setppc : 0.02 0 0 0 0 0 167 0 0
0.79/0.84 c linear : 0.08 12 413 0 12 0 2306 48 15
0.79/0.84 c logicor : 0.01 0 0 0 0 0 0 0 0
0.79/0.84 c root node : - 152 - - 152 - - - -
0.79/0.84 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.79/0.84 c integral : 0 0 0 0 0 0 0 0 0 0
0.79/0.84 c setppc : 450 1 1221 0 0 2 0 0 0 0
0.79/0.84 c linear : 0+ 0 0 0 0 0 0 0 0 0
0.79/0.84 c logicor : 378 1 979 0 0 0 0 0 0 0
0.79/0.84 c countsols : 0 0 0 0 0 0 0 0 0 0
0.79/0.84 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.79/0.84 c integral : 0.00 0.00 0.00 0.00 0.00
0.79/0.84 c setppc : 0.02 0.00 0.02 0.00 0.00
0.79/0.84 c linear : 0.00 0.00 0.00 0.00 0.00
0.79/0.84 c logicor : 0.01 0.00 0.01 0.00 0.00
0.79/0.84 c countsols : 0.00 0.00 0.00 0.00 0.00
0.79/0.84 c Propagators : Time Calls Cutoffs DomReds
0.79/0.84 c vbounds : 0.00 2 0 0
0.79/0.84 c rootredcost : 0.00 0 0 0
0.79/0.84 c pseudoobj : 0.00 2 0 0
0.79/0.84 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.79/0.84 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.79/0.84 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.84 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.84 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.84 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.79/0.84 c applied globally : - - - 0 0.0 - - -
0.79/0.84 c applied locally : - - - 0 0.0 - - -
0.79/0.84 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.79/0.84 c cut pool : 0.00 0 - - 0 - (maximal pool size: 44)
0.79/0.84 c redcost : 0.00 1 0 0 0 0
0.79/0.84 c impliedbounds : 0.00 1 0 0 14 0
0.79/0.84 c intobj : 0.00 0 0 0 0 0
0.79/0.84 c cgmip : 0.00 0 0 0 0 0
0.79/0.84 c gomory : 0.02 1 0 0 435 0
0.79/0.84 c strongcg : 0.02 1 0 0 435 0
0.79/0.84 c cmir : 0.01 1 0 0 0 0
0.79/0.84 c flowcover : 0.01 1 0 0 0 0
0.79/0.84 c clique : 0.00 1 0 0 6 0
0.79/0.84 c zerohalf : 0.00 0 0 0 0 0
0.79/0.84 c mcf : 0.00 1 0 0 0 0
0.79/0.84 c rapidlearning : 0.28 1 0 152 0 206
0.79/0.84 c Pricers : Time Calls Vars
0.79/0.84 c problem variables: 0.00 0 0
0.79/0.84 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.79/0.84 c pscost : 0.00 0 0 0 0 0 0
0.79/0.84 c inference : 0.00 0 0 0 0 0 0
0.79/0.84 c mostinf : 0.00 0 0 0 0 0 0
0.79/0.84 c leastinf : 0.00 0 0 0 0 0 0
0.79/0.84 c fullstrong : 0.00 0 0 0 0 0 0
0.79/0.84 c allfullstrong : 0.00 0 0 0 0 0 0
0.79/0.84 c random : 0.00 0 0 0 0 0 0
0.79/0.84 c relpscost : 0.00 0 0 0 0 0 0
0.79/0.84 c Primal Heuristics : Time Calls Found
0.79/0.84 c LP solutions : 0.00 - 0
0.79/0.84 c pseudo solutions : 0.00 - 0
0.79/0.84 c oneopt : 0.00 0 0
0.79/0.84 c trivial : 0.00 2 0
0.79/0.84 c simplerounding : 0.00 0 0
0.79/0.84 c zirounding : 0.00 0 0
0.79/0.84 c rounding : 0.00 1 0
0.79/0.84 c shifting : 0.00 1 0
0.79/0.84 c intshifting : 0.00 0 0
0.79/0.84 c twoopt : 0.00 0 0
0.79/0.84 c fixandinfer : 0.00 0 0
0.79/0.84 c feaspump : 0.06 1 0
0.79/0.84 c coefdiving : 0.00 0 0
0.79/0.84 c pscostdiving : 0.00 0 0
0.79/0.84 c fracdiving : 0.00 0 0
0.79/0.84 c veclendiving : 0.00 0 0
0.79/0.84 c intdiving : 0.00 0 0
0.79/0.84 c actconsdiving : 0.00 0 0
0.79/0.84 c objpscostdiving : 0.00 0 0
0.79/0.84 c rootsoldiving : 0.00 0 0
0.79/0.84 c linesearchdiving : 0.00 0 0
0.79/0.84 c guideddiving : 0.00 0 0
0.79/0.84 c octane : 0.00 0 0
0.79/0.84 c rens : 0.00 0 0
0.79/0.84 c rins : 0.00 0 0
0.79/0.84 c localbranching : 0.00 0 0
0.79/0.84 c mutation : 0.00 0 0
0.79/0.84 c crossover : 0.00 0 0
0.79/0.84 c dins : 0.00 0 0
0.79/0.84 c undercover : 0.00 0 0
0.79/0.84 c nlp : 0.00 0 0
0.79/0.84 c trysol : 0.00 0 0
0.79/0.84 c LP : Time Calls Iterations Iter/call Iter/sec
0.79/0.84 c primal LP : 0.00 0 0 0.00 -
0.79/0.84 c dual LP : 0.01 2 231 115.50 17770.60
0.79/0.84 c lex dual LP : 0.00 0 0 0.00 -
0.79/0.84 c barrier LP : 0.00 0 0 0.00 -
0.79/0.84 c diving/probing LP: 0.06 18 618 34.33 11036.31
0.79/0.84 c strong branching : 0.00 0 0 0.00 -
0.79/0.84 c (at root node) : - 0 0 0.00 -
0.79/0.84 c conflict analysis: 0.00 0 0 0.00 -
0.79/0.84 c B&B Tree :
0.79/0.84 c number of runs : 1
0.79/0.84 c nodes : 1
0.79/0.84 c nodes (total) : 1
0.79/0.84 c nodes left : 0
0.79/0.84 c max depth : 0
0.79/0.84 c max depth (total): 0
0.79/0.84 c backtracks : 0 (0.0%)
0.79/0.84 c delayed cutoffs : 0
0.79/0.84 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.79/0.84 c avg switch length: 2.00
0.79/0.84 c switching time : 0.00
0.79/0.84 c Solution :
0.79/0.84 c Solutions found : 0 (0 improvements)
0.79/0.84 c Primal Bound : infeasible
0.79/0.84 c Dual Bound : -
0.79/0.84 c Gap : 0.00 %
0.79/0.84 c Root Dual Bound : -
0.79/0.84 c Root Iterations : 849
0.79/0.86 c Time complete: 0.85.