0.00/0.01 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [Expressions interpreter: NONE]
0.00/0.01 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.01 c
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c reading problem <HOME/instance-2663511-1276645976.opb>
0.00/0.01 c original problem has 140 variables (140 bin, 0 int, 0 impl, 0 cont) and 103 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) 2 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 15 chg coeffs, 0 upgd conss, 424 impls, 0 clqs
0.01/0.02 c (round 2) 16 del vars, 12 del conss, 0 chg bounds, 0 chg sides, 27 chg coeffs, 3 upgd conss, 592 impls, 0 clqs
0.01/0.03 c (round 3) 30 del vars, 24 del conss, 0 chg bounds, 0 chg sides, 39 chg coeffs, 3 upgd conss, 592 impls, 0 clqs
0.01/0.03 c presolving (4 rounds):
0.01/0.03 c 30 deleted vars, 24 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 39 changed coefficients
0.01/0.03 c 604 implications, 0 cliques
0.01/0.03 c presolved problem has 110 variables (110 bin, 0 int, 0 impl, 0 cont) and 77 constraints
0.01/0.03 c 72 constraints of type <and>
0.01/0.03 c 2 constraints of type <linear>
0.01/0.03 c 3 constraints of type <logicor>
0.01/0.03 c transformed objective value is always integral (scale: 2)
0.01/0.03 c Presolving Time: 0.01
0.01/0.03 c - non default parameters ----------------------------------------------------------------------
0.01/0.03 c # SCIP version 1.2.1.2
0.01/0.03 c
0.01/0.03 c # frequency for displaying node information lines
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.03 c display/freq = 10000
0.01/0.03 c
0.01/0.03 c # maximal time in seconds to run
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.03 c limits/time = 1800
0.01/0.03 c
0.01/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.03 c limits/memory = 1620
0.01/0.03 c
0.01/0.03 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c lp/solvefreq = -1
0.01/0.03 c
0.01/0.03 c # should presolving try to simplify inequalities
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c constraints/linear/simplifyinequalities = TRUE
0.01/0.03 c
0.01/0.03 c # should presolving try to simplify knapsacks
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c heuristics/undercover/freq = 0
0.01/0.03 c
0.01/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c separating/rapidlearning/freq = 0
0.01/0.03 c
0.01/0.03 c -----------------------------------------------------------------------------------------------
0.01/0.03 c start solving
0.01/0.04 c
0.01/0.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.01/0.04 c 0.0s| 1 | 2 | 0 | - | 450k| 0 | - | 110 | 77 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
0.19/0.23 o 17
0.19/0.23 c * 0.2s| 1201 | 382 | 0 | 0.0 | 860k| 22 | - | 110 | 314 | 0 | 0 | 0 | 248 | 0 | 1.000000e+00 | 1.700000e+01 |1600.00%
0.19/0.24 o 3
0.19/0.24 c * 0.2s| 1234 | 296 | 0 | 0.0 | 810k| 23 | - | 110 | 324 | 0 | 0 | 0 | 260 | 0 | 1.000000e+00 | 3.000000e+00 | 200.00%
0.19/0.24 c
0.19/0.24 c SCIP Status : problem is solved [optimal solution found]
0.19/0.24 c Solving Time (sec) : 0.19
0.19/0.24 c Solving Nodes : 1235
0.19/0.24 c Primal Bound : +3.00000000000000e+00 (2 solutions)
0.19/0.24 c Dual Bound : +3.00000000000000e+00
0.19/0.24 c Gap : 0.00 %
0.19/0.24 s OPTIMUM FOUND
0.19/0.24 v -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 x29 -x28 -x27 x26 x25 -x24 -x23 x22 -x21 -x20 -x19 -x18 x17 -x16
0.19/0.24 v x15 -x14 x13 x12 -x11 -x10 x9 x8 -x7 -x6 -x5 -x4 -x3 x2 x1
0.19/0.24 c SCIP Status : problem is solved [optimal solution found]
0.19/0.24 c Solving Time : 0.19
0.19/0.24 c Original Problem :
0.19/0.24 c Problem name : HOME/instance-2663511-1276645976.opb
0.19/0.24 c Variables : 140 (140 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.24 c Constraints : 103 initial, 103 maximal
0.19/0.24 c Presolved Problem :
0.19/0.24 c Problem name : t_HOME/instance-2663511-1276645976.opb
0.19/0.24 c Variables : 110 (110 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.24 c Constraints : 77 initial, 325 maximal
0.19/0.24 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.19/0.24 c trivial : 0.00 0 0 0 0 0 0 0 0
0.19/0.24 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.19/0.24 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.19/0.24 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.19/0.24 c implics : 0.00 0 0 0 0 0 0 0 0
0.19/0.24 c probing : 0.01 0 0 0 0 0 0 0 0
0.19/0.24 c and : 0.00 4 24 0 0 0 24 0 24
0.19/0.24 c linear : 0.00 1 1 0 0 0 0 0 15
0.19/0.24 c logicor : 0.00 0 0 0 0 0 0 0 0
0.19/0.24 c root node : - 49 - - 49 - - - -
0.19/0.24 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.19/0.24 c integral : 0 0 0 0 0 0 0 0 0 0
0.19/0.24 c and : 72 0 2917 0 889 86 3858 0 0 0
0.19/0.24 c linear : 2 0 2829 0 889 330 2370 0 0 0
0.19/0.24 c logicor : 3+ 0 1006 0 882 19 340 0 0 0
0.19/0.24 c countsols : 0 0 0 0 891 0 0 0 0 0
0.19/0.24 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.19/0.24 c integral : 0.00 0.00 0.00 0.00 0.00
0.19/0.24 c and : 0.05 0.00 0.03 0.00 0.02
0.19/0.24 c linear : 0.09 0.00 0.09 0.00 0.00
0.19/0.24 c logicor : 0.00 0.00 0.00 0.00 0.00
0.19/0.24 c countsols : 0.00 0.00 0.00 0.00 0.00
0.19/0.24 c Propagators : Time Calls Cutoffs DomReds
0.19/0.24 c vbounds : 0.00 2 0 0
0.19/0.24 c rootredcost : 0.00 0 0 0
0.19/0.24 c pseudoobj : 0.00 2692 0 24
0.19/0.24 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.19/0.24 c propagation : 0.08 435 246 1817 29.9 15 27.7 -
0.19/0.24 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.24 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.24 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.24 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.19/0.24 c applied globally : - - - 248 10.8 - - -
0.19/0.24 c applied locally : - - - 13 39.3 - - -
0.19/0.24 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.19/0.24 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.19/0.24 c redcost : 0.00 0 0 0 0 0
0.19/0.24 c impliedbounds : 0.00 0 0 0 0 0
0.19/0.24 c intobj : 0.00 0 0 0 0 0
0.19/0.24 c cgmip : 0.00 0 0 0 0 0
0.19/0.24 c gomory : 0.00 0 0 0 0 0
0.19/0.24 c strongcg : 0.00 0 0 0 0 0
0.19/0.24 c cmir : 0.00 0 0 0 0 0
0.19/0.24 c flowcover : 0.00 0 0 0 0 0
0.19/0.24 c clique : 0.00 0 0 0 0 0
0.19/0.24 c zerohalf : 0.00 0 0 0 0 0
0.19/0.24 c mcf : 0.00 0 0 0 0 0
0.19/0.24 c rapidlearning : 0.00 0 0 0 0 0
0.19/0.24 c Pricers : Time Calls Vars
0.19/0.24 c problem variables: 0.00 0 0
0.19/0.24 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.19/0.24 c relpscost : 0.00 0 0 0 0 0 0
0.19/0.24 c pscost : 0.00 0 0 0 0 0 0
0.19/0.24 c inference : 0.00 889 0 0 0 0 1778
0.19/0.24 c mostinf : 0.00 0 0 0 0 0 0
0.19/0.24 c leastinf : 0.00 0 0 0 0 0 0
0.19/0.24 c fullstrong : 0.00 0 0 0 0 0 0
0.19/0.24 c allfullstrong : 0.00 0 0 0 0 0 0
0.19/0.24 c random : 0.00 0 0 0 0 0 0
0.19/0.24 c Primal Heuristics : Time Calls Found
0.19/0.24 c LP solutions : 0.00 - 0
0.19/0.24 c pseudo solutions : 0.00 - 2
0.19/0.24 c oneopt : 0.00 0 0
0.19/0.24 c trivial : 0.00 2 0
0.19/0.24 c simplerounding : 0.00 0 0
0.19/0.24 c zirounding : 0.00 0 0
0.19/0.24 c rounding : 0.00 0 0
0.19/0.24 c shifting : 0.00 0 0
0.19/0.24 c intshifting : 0.00 0 0
0.19/0.24 c twoopt : 0.00 0 0
0.19/0.24 c fixandinfer : 0.00 0 0
0.19/0.24 c feaspump : 0.00 0 0
0.19/0.24 c coefdiving : 0.00 0 0
0.19/0.24 c pscostdiving : 0.00 0 0
0.19/0.24 c fracdiving : 0.00 0 0
0.19/0.24 c veclendiving : 0.00 0 0
0.19/0.24 c intdiving : 0.00 0 0
0.19/0.24 c actconsdiving : 0.00 0 0
0.19/0.24 c objpscostdiving : 0.00 0 0
0.19/0.24 c rootsoldiving : 0.00 0 0
0.19/0.24 c linesearchdiving : 0.00 0 0
0.19/0.24 c guideddiving : 0.00 0 0
0.19/0.24 c octane : 0.00 0 0
0.19/0.24 c rens : 0.00 0 0
0.19/0.24 c rins : 0.00 0 0
0.19/0.24 c localbranching : 0.00 0 0
0.19/0.24 c mutation : 0.00 0 0
0.19/0.24 c crossover : 0.00 0 0
0.19/0.24 c dins : 0.00 0 0
0.19/0.24 c undercover : 0.00 0 0
0.19/0.24 c nlp : 0.00 0 0
0.19/0.24 c trysol : 0.00 0 0
0.19/0.24 c LP : Time Calls Iterations Iter/call Iter/sec
0.19/0.24 c primal LP : 0.00 0 0 0.00 -
0.19/0.24 c dual LP : 0.00 0 0 0.00 -
0.19/0.24 c lex dual LP : 0.00 0 0 0.00 -
0.19/0.24 c barrier LP : 0.00 0 0 0.00 -
0.19/0.24 c diving/probing LP: 0.00 0 0 0.00 -
0.19/0.24 c strong branching : 0.00 0 0 0.00 -
0.19/0.24 c (at root node) : - 0 0 0.00 -
0.19/0.24 c conflict analysis: 0.00 0 0 0.00 -
0.19/0.24 c B&B Tree :
0.19/0.24 c number of runs : 1
0.19/0.24 c nodes : 1235
0.19/0.24 c nodes (total) : 1235
0.19/0.24 c nodes left : 0
0.19/0.24 c max depth : 23
0.19/0.24 c max depth (total): 23
0.19/0.24 c backtracks : 229 (18.5%)
0.19/0.24 c delayed cutoffs : 393
0.19/0.24 c repropagations : 233 (1088 domain reductions, 91 cutoffs)
0.19/0.24 c avg switch length: 4.40
0.19/0.24 c switching time : 0.01
0.19/0.24 c Solution :
0.19/0.24 c Solutions found : 2 (2 improvements)
0.19/0.24 c First Solution : +1.70000000000000e+01 (in run 1, after 1201 nodes, 0.19 seconds, depth 20, found by <relaxation>)
0.19/0.24 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1234 nodes, 0.19 seconds, depth 16, found by <relaxation>)
0.19/0.24 c Dual Bound : +3.00000000000000e+00
0.19/0.24 c Gap : 0.00 %
0.19/0.24 c Root Dual Bound : +1.00000000000000e+00
0.19/0.24 c Root Iterations : 0
0.19/0.25 c Time complete: 0.24.