0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [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-2683999-1277511699.opb>
0.00/0.01 c original problem has 47 variables (47 bin, 0 int, 0 impl, 0 cont) and 257 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 21 del vars, 41 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 300 impls, 0 clqs
0.00/0.02 c (round 2) 23 del vars, 43 del conss, 3 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 300 impls, 0 clqs
0.00/0.02 c (round 3) 30 del vars, 80 del conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 320 impls, 0 clqs
0.00/0.02 c (round 4) 34 del vars, 222 del conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 320 impls, 0 clqs
0.00/0.03 c (round 5) 34 del vars, 237 del conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 20 upgd conss, 320 impls, 0 clqs
0.00/0.03 c (round 6) 39 del vars, 237 del conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 20 upgd conss, 323 impls, 0 clqs
0.00/0.03 c (round 7) 39 del vars, 239 del conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 20 upgd conss, 323 impls, 0 clqs
0.00/0.03 c (round 8) 39 del vars, 240 del conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 20 upgd conss, 323 impls, 0 clqs
0.00/0.03 c presolving (9 rounds):
0.00/0.03 c 39 deleted vars, 240 deleted constraints, 14 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 323 implications, 0 cliques
0.00/0.03 c presolved problem has 8 variables (8 bin, 0 int, 0 impl, 0 cont) and 17 constraints
0.00/0.03 c 17 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 256)
0.00/0.03 c Presolving Time: 0.01
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.2
0.00/0.03 c
0.00/0.03 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c conflict/interconss = 0
0.00/0.03 c
0.00/0.03 c # should binary conflicts be preferred?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c conflict/preferbinary = TRUE
0.00/0.03 c
0.00/0.03 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c constraints/agelimit = 1
0.00/0.03 c
0.00/0.03 c # should enforcement of pseudo solution be disabled?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/disableenfops = TRUE
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1800
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c lp/solvefreq = -1
0.00/0.03 c
0.00/0.03 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.00/0.03 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.03 c lp/pricing = a
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # priority of node selection rule <dfs> in standard mode
0.00/0.03 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.03 c nodeselection/dfs/stdpriority = 1000000
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.00/0.03 o 14
0.00/0.03 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.03 c t 0.0s| 1 | 0 | 0 | - | 294k| 0 | - | 8 | 17 | 0 | 0 | 0 | 0 | 0 | -- | 1.400000e+01 | Inf
0.00/0.03 c 0.0s| 1 | 0 | 0 | - | 293k| 0 | - | 8 | 17 | 0 | 0 | 0 | 0 | 0 | 1.400000e+01 | 1.400000e+01 | 0.00%
0.00/0.03 c
0.00/0.03 c SCIP Status : problem is solved [optimal solution found]
0.00/0.03 c Solving Time (sec) : 0.01
0.00/0.03 c Solving Nodes : 1
0.00/0.03 c Primal Bound : +1.40000000000000e+01 (3 solutions)
0.00/0.03 c Dual Bound : +1.40000000000000e+01
0.00/0.03 c Gap : 0.00 %
0.00/0.03 s OPTIMUM FOUND
0.00/0.03 v x19 x18 x17 x16 x15 x14 x13 x12 -x11 x10 -x9 x8 x6 x7 x5 -x4 -x3 x2 x1 x47 x46 x45 x44 x43 x42 x41 x40 x39 x38 x37 x36 x35 x34
0.00/0.03 v -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20
0.00/0.03 c SCIP Status : problem is solved [optimal solution found]
0.00/0.03 c Solving Time : 0.01
0.00/0.03 c Original Problem :
0.00/0.03 c Problem name : HOME/instance-2683999-1277511699.opb
0.00/0.03 c Variables : 47 (47 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.03 c Constraints : 257 initial, 257 maximal
0.00/0.03 c Presolved Problem :
0.00/0.03 c Problem name : t_HOME/instance-2683999-1277511699.opb
0.00/0.03 c Variables : 8 (8 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.03 c Constraints : 17 initial, 17 maximal
0.00/0.03 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.03 c trivial : 0.00 4 0 0 0 0 0 0 0
0.00/0.03 c dualfix : 0.00 10 0 0 0 0 0 0 0
0.00/0.03 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.00/0.03 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.00/0.03 c implics : 0.00 0 0 0 0 0 0 0 0
0.00/0.03 c probing : 0.00 1 4 0 0 0 0 0 0
0.00/0.03 c linear : 0.01 10 10 0 14 0 237 0 0
0.00/0.03 c logicor : 0.00 0 0 0 0 0 3 0 0
0.00/0.03 c root node : - 0 - - 0 - - - -
0.00/0.03 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.00/0.03 c integral : 0 0 0 0 0 0 0 0 0 0
0.00/0.03 c logicor : 17 0 28 0 0 0 0 0 0 0
0.00/0.03 c countsols : 0 0 0 0 0 0 0 0 0 0
0.00/0.03 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.00/0.03 c integral : 0.00 0.00 0.00 0.00 0.00
0.00/0.03 c logicor : 0.00 0.00 0.00 0.00 0.00
0.00/0.03 c countsols : 0.00 0.00 0.00 0.00 0.00
0.00/0.03 c Propagators : Time Calls Cutoffs DomReds
0.00/0.03 c vbounds : 0.00 1 0 0
0.00/0.03 c rootredcost : 0.00 0 0 0
0.00/0.03 c pseudoobj : 0.00 0 0 0
0.00/0.03 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.03 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.03 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.03 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.03 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.03 c pseudo solution : 0.00 1 0 0 0.0 0 0.0 -
0.00/0.03 c applied globally : - - - 0 0.0 - - -
0.00/0.03 c applied locally : - - - 0 0.0 - - -
0.00/0.03 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.03 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.03 c redcost : 0.00 0 0 0 0 0
0.00/0.03 c impliedbounds : 0.00 0 0 0 0 0
0.00/0.03 c intobj : 0.00 0 0 0 0 0
0.00/0.03 c cgmip : 0.00 0 0 0 0 0
0.00/0.03 c gomory : 0.00 0 0 0 0 0
0.00/0.03 c strongcg : 0.00 0 0 0 0 0
0.00/0.03 c cmir : 0.00 0 0 0 0 0
0.00/0.03 c flowcover : 0.00 0 0 0 0 0
0.00/0.03 c clique : 0.00 0 0 0 0 0
0.00/0.03 c zerohalf : 0.00 0 0 0 0 0
0.00/0.03 c mcf : 0.00 0 0 0 0 0
0.00/0.03 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.03 c Pricers : Time Calls Vars
0.00/0.03 c problem variables: 0.00 0 0
0.00/0.03 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.03 c pscost : 0.00 0 0 0 0 0 0
0.00/0.03 c inference : 0.00 0 0 0 0 0 0
0.00/0.03 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.03 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.03 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.03 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.03 c random : 0.00 0 0 0 0 0 0
0.00/0.03 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.03 c Primal Heuristics : Time Calls Found
0.00/0.03 c LP solutions : 0.00 - 0
0.00/0.03 c pseudo solutions : 0.00 - 0
0.00/0.03 c oneopt : 0.00 0 0
0.00/0.03 c trivial : 0.00 2 3
0.00/0.03 c simplerounding : 0.00 0 0
0.00/0.03 c zirounding : 0.00 0 0
0.00/0.03 c rounding : 0.00 0 0
0.00/0.03 c shifting : 0.00 0 0
0.00/0.03 c intshifting : 0.00 0 0
0.00/0.03 c twoopt : 0.00 0 0
0.00/0.03 c fixandinfer : 0.00 0 0
0.00/0.03 c feaspump : 0.00 0 0
0.00/0.03 c coefdiving : 0.00 0 0
0.00/0.03 c pscostdiving : 0.00 0 0
0.00/0.03 c fracdiving : 0.00 0 0
0.00/0.03 c veclendiving : 0.00 0 0
0.00/0.03 c intdiving : 0.00 0 0
0.00/0.03 c actconsdiving : 0.00 0 0
0.00/0.03 c objpscostdiving : 0.00 0 0
0.00/0.03 c rootsoldiving : 0.00 0 0
0.00/0.03 c linesearchdiving : 0.00 0 0
0.00/0.03 c guideddiving : 0.00 0 0
0.00/0.03 c octane : 0.00 0 0
0.00/0.03 c rens : 0.00 0 0
0.00/0.03 c rins : 0.00 0 0
0.00/0.03 c localbranching : 0.00 0 0
0.00/0.03 c mutation : 0.00 0 0
0.00/0.03 c crossover : 0.00 0 0
0.00/0.03 c dins : 0.00 0 0
0.00/0.03 c undercover : 0.00 0 0
0.00/0.03 c nlp : 0.00 0 0
0.00/0.03 c trysol : 0.00 0 0
0.00/0.03 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.03 c primal LP : 0.00 0 0 0.00 -
0.00/0.03 c dual LP : 0.00 0 0 0.00 -
0.00/0.03 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.03 c barrier LP : 0.00 0 0 0.00 -
0.00/0.03 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.03 c strong branching : 0.00 0 0 0.00 -
0.00/0.03 c (at root node) : - 0 0 0.00 -
0.00/0.03 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.03 c B&B Tree :
0.00/0.03 c number of runs : 1
0.00/0.03 c nodes : 1
0.00/0.03 c nodes (total) : 1
0.00/0.03 c nodes left : 0
0.00/0.03 c max depth : 0
0.00/0.03 c max depth (total): 0
0.00/0.03 c backtracks : 0 (0.0%)
0.00/0.03 c delayed cutoffs : 0
0.00/0.03 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.03 c avg switch length: 2.00
0.00/0.03 c switching time : 0.00
0.00/0.03 c Solution :
0.00/0.03 c Solutions found : 3 (1 improvements)
0.00/0.03 c First Solution : +1.40000000000000e+01 (in run 1, after 1 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.00/0.03 c Primal Bound : +1.40000000000000e+01 (in run 1, after 1 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.00/0.03 c Dual Bound : +1.40000000000000e+01
0.00/0.03 c Gap : 0.00 %
0.00/0.03 c Root Dual Bound : +1.40000000000000e+01
0.00/0.03 c Root Iterations : 0
0.00/0.04 c Time complete: 0.04.