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-2703515-1278560644.opb>
0.10/0.11 c [src/scip/reader_opb.c:3100] Warning: there might be <186> coefficients or weight out of range!
0.10/0.11 c original problem has 9818 variables (9818 bin, 0 int, 0 impl, 0 cont) and 291 constraints
0.10/0.11 c problem read
0.10/0.11 c presolving settings loaded
0.19/0.21 c presolving:
0.19/0.25 c (round 1) 2514 del vars, 2 del conss, 2447 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.19/0.25 c (round 2) 2543 del vars, 2 del conss, 2450 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.19/0.27 c (round 3) 2543 del vars, 2 del conss, 2450 chg bounds, 0 chg sides, 0 chg coeffs, 196 upgd conss, 0 impls, 0 clqs
0.19/0.29 c (round 4) 2543 del vars, 2 del conss, 2450 chg bounds, 0 chg sides, 196 chg coeffs, 196 upgd conss, 0 impls, 784 clqs
0.29/0.33 c (round 5) 2543 del vars, 2 del conss, 2450 chg bounds, 784 chg sides, 2548 chg coeffs, 196 upgd conss, 0 impls, 784 clqs
0.49/0.59 c (0.5s) probing: 199/7275 (2.7%) - 0 fixings, 0 aggregations, 3920 implications, 0 bound changes
0.49/0.59 c (0.5s) probing aborted: 100/100 successive totally useless probings
0.49/0.59 c presolving (6 rounds):
0.49/0.59 c 2543 deleted vars, 2 deleted constraints, 2450 tightened bounds, 0 added holes, 784 changed sides, 2548 changed coefficients
0.49/0.59 c 7840 implications, 784 cliques
0.49/0.59 c presolved problem has 7275 variables (7275 bin, 0 int, 0 impl, 0 cont) and 1073 constraints
0.49/0.59 c 196 constraints of type <knapsack>
0.49/0.59 c 784 constraints of type <setppc>
0.49/0.59 c 93 constraints of type <linear>
0.49/0.59 c transformed objective value is always integral (scale: 1)
0.49/0.59 c Presolving Time: 0.44
0.49/0.59 c - non default parameters ----------------------------------------------------------------------
0.49/0.59 c # SCIP version 1.2.1.3
0.49/0.59 c
0.49/0.59 c # frequency for displaying node information lines
0.49/0.59 c # [type: int, range: [-1,2147483647], default: 100]
0.49/0.59 c display/freq = 10000
0.49/0.59 c
0.49/0.59 c # maximal time in seconds to run
0.49/0.59 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.49/0.59 c limits/time = 1789.89
0.49/0.59 c
0.49/0.59 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.49/0.59 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.49/0.59 c limits/memory = 1620
0.49/0.59 c
0.49/0.59 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.49/0.59 c # [type: int, range: [1,2], default: 1]
0.49/0.59 c timing/clocktype = 2
0.49/0.59 c
0.49/0.59 c # should presolving try to simplify inequalities
0.49/0.59 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.49/0.59 c constraints/linear/simplifyinequalities = TRUE
0.49/0.59 c
0.49/0.59 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.49/0.59 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.49/0.59 c constraints/indicator/addCouplingCons = TRUE
0.49/0.59 c
0.49/0.59 c # should presolving try to simplify knapsacks
0.49/0.59 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.49/0.59 c constraints/knapsack/simplifyinequalities = TRUE
0.49/0.59 c
0.49/0.59 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.49/0.59 c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.59 c separating/rapidlearning/freq = 0
0.49/0.59 c
0.49/0.59 c -----------------------------------------------------------------------------------------------
0.49/0.59 c start solving
0.59/0.60 c
0.69/0.79 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.79 c 0.7s| 1 | 0 | 493 | - | 26M| 0 | - |7275 |1073 |7275 |1073 | 0 | 0 | 0 | -- | -- | 0.00%
0.69/0.79 c 0.7s| 1 | 0 | 493 | - | 26M| 0 | - |7275 |1073 |7275 |1073 | 0 | 0 | 0 | -- | -- | 0.00%
0.69/0.79 c
0.69/0.79 c SCIP Status : problem is solved [infeasible]
0.69/0.79 c Solving Time (sec) : 0.69
0.69/0.79 c Solving Nodes : 1
0.69/0.79 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.69/0.79 c Dual Bound : +1.00000000000000e+20
0.69/0.79 c Gap : 0.00 %
0.69/0.79 s UNSATISFIABLE
0.69/0.79 c SCIP Status : problem is solved [infeasible]
0.69/0.79 c Solving Time : 0.69
0.69/0.79 c Original Problem :
0.69/0.79 c Problem name : HOME/instance-2703515-1278560644.opb
0.69/0.79 c Variables : 9818 (9818 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.79 c Constraints : 291 initial, 291 maximal
0.69/0.79 c Presolved Problem :
0.69/0.79 c Problem name : t_HOME/instance-2703515-1278560644.opb
0.69/0.79 c Variables : 7275 (7275 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.79 c Constraints : 1073 initial, 1073 maximal
0.69/0.79 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.69/0.79 c trivial : 0.01 0 0 0 0 0 0 0 0
0.69/0.79 c dualfix : 0.01 0 0 0 0 0 0 0 0
0.69/0.79 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.69/0.79 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.69/0.79 c implics : 0.01 0 0 0 0 0 0 0 0
0.69/0.79 c probing : 0.25 0 0 0 0 0 0 0 0
0.69/0.79 c knapsack : 0.05 0 0 0 0 0 0 784 2548
0.69/0.79 c setppc : 0.01 0 0 0 0 0 0 0 0
0.69/0.79 c linear : 0.05 2512 31 0 2450 0 2 0 0
0.69/0.79 c root node : - 0 - - 0 - - - -
0.69/0.79 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.69/0.79 c integral : 0 0 0 0 0 0 0 0 0 0
0.69/0.79 c knapsack : 196 0 495 0 0 0 0 0 0 0
0.69/0.79 c setppc : 784 0 495 0 0 0 0 0 0 0
0.69/0.79 c linear : 93 0 495 0 0 0 0 0 0 0
0.69/0.79 c countsols : 0 0 0 0 0 0 0 0 0 0
0.69/0.79 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.69/0.79 c integral : 0.00 0.00 0.00 0.00 0.00
0.69/0.79 c knapsack : 0.01 0.00 0.01 0.00 0.00
0.69/0.79 c setppc : 0.02 0.00 0.02 0.00 0.00
0.69/0.79 c linear : 0.03 0.00 0.03 0.00 0.00
0.69/0.79 c countsols : 0.00 0.00 0.00 0.00 0.00
0.69/0.80 c Propagators : Time Calls Cutoffs DomReds
0.69/0.80 c vbounds : 0.00 2 0 0
0.69/0.80 c rootredcost : 0.00 0 0 0
0.69/0.80 c pseudoobj : 0.00 2 1 0
0.69/0.80 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.69/0.80 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.80 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.80 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.80 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.80 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.80 c applied globally : - - - 0 0.0 - - -
0.69/0.80 c applied locally : - - - 0 0.0 - - -
0.69/0.80 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.69/0.80 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.69/0.80 c redcost : 0.00 0 0 0 0 0
0.69/0.80 c impliedbounds : 0.00 0 0 0 0 0
0.69/0.80 c intobj : 0.00 0 0 0 0 0
0.69/0.80 c cgmip : 0.00 0 0 0 0 0
0.69/0.80 c gomory : 0.00 0 0 0 0 0
0.69/0.80 c strongcg : 0.00 0 0 0 0 0
0.69/0.80 c cmir : 0.00 0 0 0 0 0
0.69/0.80 c flowcover : 0.00 0 0 0 0 0
0.69/0.80 c clique : 0.00 0 0 0 0 0
0.69/0.80 c zerohalf : 0.00 0 0 0 0 0
0.69/0.80 c mcf : 0.00 0 0 0 0 0
0.69/0.80 c rapidlearning : 0.00 0 0 0 0 0
0.69/0.80 c Pricers : Time Calls Vars
0.69/0.80 c problem variables: 0.00 0 0
0.69/0.80 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.69/0.80 c pscost : 0.00 0 0 0 0 0 0
0.69/0.80 c inference : 0.00 0 0 0 0 0 0
0.69/0.80 c mostinf : 0.00 0 0 0 0 0 0
0.69/0.80 c leastinf : 0.00 0 0 0 0 0 0
0.69/0.80 c fullstrong : 0.00 0 0 0 0 0 0
0.69/0.80 c allfullstrong : 0.00 0 0 0 0 0 0
0.69/0.80 c random : 0.00 0 0 0 0 0 0
0.69/0.80 c relpscost : 0.00 0 0 0 0 0 0
0.69/0.80 c Primal Heuristics : Time Calls Found
0.69/0.80 c LP solutions : 0.00 - 0
0.69/0.80 c pseudo solutions : 0.00 - 0
0.69/0.80 c oneopt : 0.00 0 0
0.69/0.80 c trivial : 0.02 2 0
0.69/0.80 c simplerounding : 0.00 0 0
0.69/0.80 c zirounding : 0.00 0 0
0.69/0.80 c rounding : 0.00 0 0
0.69/0.80 c shifting : 0.00 0 0
0.69/0.80 c intshifting : 0.00 0 0
0.69/0.80 c twoopt : 0.00 0 0
0.69/0.80 c fixandinfer : 0.00 0 0
0.69/0.80 c feaspump : 0.00 0 0
0.69/0.80 c coefdiving : 0.00 0 0
0.69/0.80 c pscostdiving : 0.00 0 0
0.69/0.80 c fracdiving : 0.00 0 0
0.69/0.80 c veclendiving : 0.00 0 0
0.69/0.80 c intdiving : 0.00 0 0
0.69/0.80 c actconsdiving : 0.00 0 0
0.69/0.80 c objpscostdiving : 0.00 0 0
0.69/0.80 c rootsoldiving : 0.00 0 0
0.69/0.80 c linesearchdiving : 0.00 0 0
0.69/0.80 c guideddiving : 0.00 0 0
0.69/0.80 c octane : 0.00 0 0
0.69/0.80 c rens : 0.00 0 0
0.69/0.80 c rins : 0.00 0 0
0.69/0.80 c localbranching : 0.00 0 0
0.69/0.80 c mutation : 0.00 0 0
0.69/0.80 c crossover : 0.00 0 0
0.69/0.80 c dins : 0.00 0 0
0.69/0.80 c undercover : 0.00 0 0
0.69/0.80 c nlp : 0.00 0 0
0.69/0.80 c trysol : 0.00 0 0
0.69/0.80 c LP : Time Calls Iterations Iter/call Iter/sec
0.69/0.80 c primal LP : 0.00 0 0 0.00 -
0.69/0.80 c dual LP : 0.15 1 493 493.00 3180.67
0.69/0.80 c lex dual LP : 0.00 0 0 0.00 -
0.69/0.80 c barrier LP : 0.00 0 0 0.00 -
0.69/0.80 c diving/probing LP: 0.00 0 0 0.00 -
0.69/0.80 c strong branching : 0.00 0 0 0.00 -
0.69/0.80 c (at root node) : - 0 0 0.00 -
0.69/0.80 c conflict analysis: 0.00 0 0 0.00 -
0.69/0.80 c B&B Tree :
0.69/0.80 c number of runs : 1
0.69/0.80 c nodes : 1
0.69/0.80 c nodes (total) : 1
0.69/0.80 c nodes left : 0
0.69/0.80 c max depth : 0
0.69/0.80 c max depth (total): 0
0.69/0.80 c backtracks : 0 (0.0%)
0.69/0.80 c delayed cutoffs : 0
0.69/0.80 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.69/0.80 c avg switch length: 2.00
0.69/0.80 c switching time : 0.00
0.69/0.80 c Solution :
0.69/0.80 c Solutions found : 0 (0 improvements)
0.69/0.80 c Primal Bound : infeasible
0.69/0.80 c Dual Bound : -
0.69/0.80 c Gap : 0.00 %
0.69/0.80 c Root Dual Bound : -
0.69/0.80 c Root Iterations : 493
0.79/0.86 c Time complete: 0.85.