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-2703891-1278559828.opb>
0.00/0.02 c [src/scip/reader_opb.c:3100] Warning: there might be <654> coefficients or weight out of range!
0.00/0.02 c original problem has 240 variables (240 bin, 0 int, 0 impl, 0 cont) and 14 constraints
0.00/0.02 c problem read
0.00/0.02 c presolving settings loaded
0.00/0.02 c presolving:
0.00/0.02 c (round 1) 41 del vars, 0 del conss, 40 chg bounds, 3 chg sides, 26 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.00/0.03 c (round 2) 41 del vars, 0 del conss, 40 chg bounds, 3 chg sides, 26 chg coeffs, 14 upgd conss, 0 impls, 0 clqs
0.03/0.04 c (round 3) 43 del vars, 5 del conss, 40 chg bounds, 70 chg sides, 3860 chg coeffs, 14 upgd conss, 2 impls, 0 clqs
0.03/0.05 c (round 4) 48 del vars, 6 del conss, 40 chg bounds, 78 chg sides, 3868 chg coeffs, 14 upgd conss, 2 impls, 0 clqs
0.03/0.06 c (0.0s) probing: 101/192 (52.6%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.03/0.06 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.03/0.06 c presolving (5 rounds):
0.03/0.06 c 48 deleted vars, 6 deleted constraints, 40 tightened bounds, 0 added holes, 78 changed sides, 3868 changed coefficients
0.03/0.06 c 2 implications, 0 cliques
0.03/0.06 c presolved problem has 192 variables (192 bin, 0 int, 0 impl, 0 cont) and 12 constraints
0.03/0.06 c 12 constraints of type <knapsack>
0.03/0.06 c transformed objective value is always integral (scale: 1)
0.03/0.06 c Presolving Time: 0.04
0.03/0.06 c - non default parameters ----------------------------------------------------------------------
0.03/0.06 c # SCIP version 1.2.1.3
0.03/0.06 c
0.03/0.06 c # frequency for displaying node information lines
0.03/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.03/0.06 c display/freq = 10000
0.03/0.06 c
0.03/0.06 c # maximal time in seconds to run
0.03/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.06 c limits/time = 1789.99
0.03/0.06 c
0.03/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.03/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.06 c limits/memory = 1620
0.03/0.06 c
0.03/0.06 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.03/0.06 c # [type: int, range: [1,2], default: 1]
0.03/0.06 c timing/clocktype = 2
0.03/0.06 c
0.03/0.06 c # should presolving try to simplify inequalities
0.03/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.06 c constraints/linear/simplifyinequalities = TRUE
0.03/0.06 c
0.03/0.06 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.03/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.06 c constraints/indicator/addCouplingCons = TRUE
0.03/0.06 c
0.03/0.06 c # should presolving try to simplify knapsacks
0.03/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.03/0.06 c
0.03/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.03/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.06 c separating/rapidlearning/freq = 0
0.03/0.06 c
0.03/0.06 c -----------------------------------------------------------------------------------------------
0.03/0.06 c start solving
0.03/0.06 c
0.03/0.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.03/0.07 c 0.0s| 1 | 0 | 147 | - |1122k| 0 | - | 192 | 12 | 192 | 12 | 0 | 0 | 0 | -- | -- | 0.00%
0.03/0.07 c 0.0s| 1 | 0 | 147 | - |1122k| 0 | - | 192 | 12 | 192 | 12 | 0 | 0 | 0 | -- | -- | 0.00%
0.03/0.07 c
0.03/0.07 c SCIP Status : problem is solved [infeasible]
0.03/0.07 c Solving Time (sec) : 0.05
0.03/0.07 c Solving Nodes : 1
0.03/0.07 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.03/0.07 c Dual Bound : +1.00000000000000e+20
0.03/0.07 c Gap : 0.00 %
0.03/0.07 s UNSATISFIABLE
0.03/0.07 c SCIP Status : problem is solved [infeasible]
0.03/0.07 c Solving Time : 0.05
0.03/0.07 c Original Problem :
0.03/0.07 c Problem name : HOME/instance-2703891-1278559828.opb
0.03/0.07 c Variables : 240 (240 binary, 0 integer, 0 implicit integer, 0 continuous)
0.03/0.07 c Constraints : 14 initial, 14 maximal
0.03/0.07 c Presolved Problem :
0.03/0.07 c Problem name : t_HOME/instance-2703891-1278559828.opb
0.03/0.07 c Variables : 192 (192 binary, 0 integer, 0 implicit integer, 0 continuous)
0.03/0.07 c Constraints : 12 initial, 12 maximal
0.03/0.07 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.03/0.07 c trivial : 0.00 0 0 0 0 0 0 0 0
0.03/0.07 c dualfix : 0.00 6 0 0 0 0 0 0 0
0.03/0.07 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.03/0.07 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.03/0.07 c implics : 0.00 0 0 0 0 0 0 0 0
0.03/0.07 c probing : 0.01 0 0 0 0 0 0 0 0
0.03/0.07 c knapsack : 0.02 2 0 0 0 0 2 75 3842
0.03/0.07 c setppc : 0.00 0 0 0 0 0 4 0 0
0.03/0.07 c linear : 0.00 40 0 0 40 0 0 3 26
0.03/0.07 c root node : - 0 - - 0 - - - -
0.03/0.07 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.03/0.07 c integral : 0 0 0 0 0 0 0 0 0 0
0.03/0.07 c knapsack : 12 0 201 0 0 0 0 0 0 0
0.03/0.07 c countsols : 0 0 0 0 0 0 0 0 0 0
0.03/0.07 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.03/0.07 c integral : 0.00 0.00 0.00 0.00 0.00
0.03/0.07 c knapsack : 0.01 0.00 0.01 0.00 0.00
0.03/0.07 c countsols : 0.00 0.00 0.00 0.00 0.00
0.03/0.07 c Propagators : Time Calls Cutoffs DomReds
0.03/0.07 c vbounds : 0.00 2 0 0
0.03/0.07 c rootredcost : 0.00 0 0 0
0.03/0.07 c pseudoobj : 0.00 2 1 0
0.03/0.07 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.03/0.07 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.03/0.07 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.03/0.07 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.03/0.07 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.03/0.07 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.03/0.07 c applied globally : - - - 0 0.0 - - -
0.03/0.07 c applied locally : - - - 0 0.0 - - -
0.03/0.07 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.03/0.07 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.03/0.07 c redcost : 0.00 0 0 0 0 0
0.03/0.07 c impliedbounds : 0.00 0 0 0 0 0
0.03/0.07 c intobj : 0.00 0 0 0 0 0
0.03/0.07 c cgmip : 0.00 0 0 0 0 0
0.03/0.07 c gomory : 0.00 0 0 0 0 0
0.03/0.07 c strongcg : 0.00 0 0 0 0 0
0.03/0.07 c cmir : 0.00 0 0 0 0 0
0.03/0.07 c flowcover : 0.00 0 0 0 0 0
0.03/0.07 c clique : 0.00 0 0 0 0 0
0.03/0.07 c zerohalf : 0.00 0 0 0 0 0
0.03/0.07 c mcf : 0.00 0 0 0 0 0
0.03/0.07 c rapidlearning : 0.00 0 0 0 0 0
0.03/0.07 c Pricers : Time Calls Vars
0.03/0.07 c problem variables: 0.00 0 0
0.03/0.07 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.03/0.07 c pscost : 0.00 0 0 0 0 0 0
0.03/0.07 c inference : 0.00 0 0 0 0 0 0
0.03/0.07 c mostinf : 0.00 0 0 0 0 0 0
0.03/0.07 c leastinf : 0.00 0 0 0 0 0 0
0.03/0.07 c fullstrong : 0.00 0 0 0 0 0 0
0.03/0.07 c allfullstrong : 0.00 0 0 0 0 0 0
0.03/0.07 c random : 0.00 0 0 0 0 0 0
0.03/0.07 c relpscost : 0.00 0 0 0 0 0 0
0.03/0.07 c Primal Heuristics : Time Calls Found
0.03/0.07 c LP solutions : 0.00 - 0
0.03/0.07 c pseudo solutions : 0.00 - 0
0.03/0.07 c oneopt : 0.00 0 0
0.03/0.07 c trivial : 0.00 2 0
0.03/0.07 c simplerounding : 0.00 0 0
0.03/0.07 c zirounding : 0.00 0 0
0.03/0.07 c rounding : 0.00 0 0
0.03/0.07 c shifting : 0.00 0 0
0.03/0.07 c intshifting : 0.00 0 0
0.03/0.07 c twoopt : 0.00 0 0
0.03/0.07 c fixandinfer : 0.00 0 0
0.03/0.07 c feaspump : 0.00 0 0
0.03/0.07 c coefdiving : 0.00 0 0
0.03/0.07 c pscostdiving : 0.00 0 0
0.03/0.07 c fracdiving : 0.00 0 0
0.03/0.07 c veclendiving : 0.00 0 0
0.03/0.07 c intdiving : 0.00 0 0
0.03/0.07 c actconsdiving : 0.00 0 0
0.03/0.07 c objpscostdiving : 0.00 0 0
0.03/0.07 c rootsoldiving : 0.00 0 0
0.03/0.07 c linesearchdiving : 0.00 0 0
0.03/0.07 c guideddiving : 0.00 0 0
0.03/0.07 c octane : 0.00 0 0
0.03/0.07 c rens : 0.00 0 0
0.03/0.07 c rins : 0.00 0 0
0.03/0.07 c localbranching : 0.00 0 0
0.03/0.07 c mutation : 0.00 0 0
0.03/0.07 c crossover : 0.00 0 0
0.03/0.07 c dins : 0.00 0 0
0.03/0.07 c undercover : 0.00 0 0
0.03/0.07 c nlp : 0.00 0 0
0.03/0.07 c trysol : 0.00 0 0
0.03/0.07 c LP : Time Calls Iterations Iter/call Iter/sec
0.03/0.07 c primal LP : 0.00 0 0 0.00 -
0.03/0.07 c dual LP : 0.00 1 147 147.00 -
0.03/0.07 c lex dual LP : 0.00 0 0 0.00 -
0.03/0.07 c barrier LP : 0.00 0 0 0.00 -
0.03/0.07 c diving/probing LP: 0.00 0 0 0.00 -
0.03/0.07 c strong branching : 0.00 0 0 0.00 -
0.03/0.07 c (at root node) : - 0 0 0.00 -
0.03/0.07 c conflict analysis: 0.00 0 0 0.00 -
0.03/0.07 c B&B Tree :
0.03/0.07 c number of runs : 1
0.03/0.07 c nodes : 1
0.03/0.07 c nodes (total) : 1
0.03/0.07 c nodes left : 0
0.03/0.07 c max depth : 0
0.03/0.07 c max depth (total): 0
0.03/0.07 c backtracks : 0 (0.0%)
0.03/0.07 c delayed cutoffs : 0
0.03/0.07 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.03/0.07 c avg switch length: 2.00
0.03/0.07 c switching time : 0.00
0.03/0.07 c Solution :
0.03/0.07 c Solutions found : 0 (0 improvements)
0.03/0.07 c Primal Bound : infeasible
0.03/0.07 c Dual Bound : -
0.03/0.07 c Gap : 0.00 %
0.03/0.07 c Root Dual Bound : -
0.03/0.07 c Root Iterations : 147
0.03/0.07 c Time complete: 0.07.