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-2663721-1276650857.opb>
0.00/0.01 c original problem has 270 variables (270 bin, 0 int, 0 impl, 0 cont) and 191 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.03 c (round 1) 5 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 24 chg coeffs, 0 upgd conss, 1000 impls, 0 clqs
0.00/0.04 c (round 2) 17 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 34 chg coeffs, 6 upgd conss, 1480 impls, 0 clqs
0.00/0.04 c (round 3) 29 del vars, 20 del conss, 0 chg bounds, 0 chg sides, 44 chg coeffs, 6 upgd conss, 1840 impls, 0 clqs
0.00/0.04 c (round 4) 41 del vars, 30 del conss, 0 chg bounds, 0 chg sides, 54 chg coeffs, 6 upgd conss, 2080 impls, 0 clqs
0.00/0.05 c (round 5) 53 del vars, 40 del conss, 0 chg bounds, 0 chg sides, 64 chg coeffs, 6 upgd conss, 2200 impls, 0 clqs
0.00/0.05 c (round 6) 65 del vars, 50 del conss, 0 chg bounds, 0 chg sides, 74 chg coeffs, 6 upgd conss, 2200 impls, 0 clqs
0.00/0.06 c (0.0s) probing: 147/205 (71.7%) - 0 fixings, 0 aggregations, 10 implications, 0 bound changes
0.00/0.06 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.06 c presolving (7 rounds):
0.00/0.06 c 65 deleted vars, 50 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 74 changed coefficients
0.00/0.06 c 2220 implications, 0 cliques
0.00/0.06 c presolved problem has 205 variables (205 bin, 0 int, 0 impl, 0 cont) and 136 constraints
0.00/0.06 c 125 constraints of type <and>
0.00/0.06 c 5 constraints of type <linear>
0.00/0.06 c 6 constraints of type <logicor>
0.00/0.06 c transformed objective value is always integral (scale: 2)
0.00/0.06 c Presolving Time: 0.04
0.00/0.06 c - non default parameters ----------------------------------------------------------------------
0.00/0.06 c # SCIP version 1.2.1.2
0.00/0.06 c
0.00/0.06 c # frequency for displaying node information lines
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.06 c display/freq = 10000
0.00/0.06 c
0.00/0.06 c # maximal time in seconds to run
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/time = 1800
0.00/0.06 c
0.00/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/memory = 1620
0.00/0.06 c
0.00/0.06 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c lp/solvefreq = -1
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify inequalities
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/linear/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify knapsacks
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c heuristics/undercover/freq = 0
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c separating/rapidlearning/freq = 0
0.00/0.06 c
0.00/0.06 c -----------------------------------------------------------------------------------------------
0.00/0.06 c start solving
0.00/0.07 c
0.00/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.00/0.07 c 0.0s| 1 | 2 | 0 | - | 752k| 0 | - | 205 | 136 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
1.09/1.14 o 25
1.09/1.14 c * 0.9s| 5923 | 3623 | 0 | 0.0 |3455k| 72 | - | 205 | 524 | 0 | 0 | 0 | 903 | 0 | 1.000000e+00 | 2.500000e+01 |2400.00%
1.89/1.94 c 1.6s| 10000 | 6646 | 0 | 0.0 |5675k| 72 | - | 205 | 611 | 0 | 0 | 0 |1599 | 0 | 1.000000e+00 | 2.500000e+01 |2400.00%
2.99/3.08 o 15
2.99/3.08 c * 2.6s| 15420 | 7929 | 0 | 0.0 |7051k| 72 | - | 205 | 991 | 0 | 0 | 0 |2630 | 0 | 1.000000e+00 | 1.500000e+01 |1400.00%
3.99/4.06 o 3
3.99/4.06 c * 3.5s| 19105 | 4638 | 0 | 0.0 |4731k| 72 | - | 205 | 543 | 0 | 0 | 0 |3725 | 0 | 1.000000e+00 | 3.000000e+00 | 200.00%
3.99/4.09 c
3.99/4.09 c SCIP Status : problem is solved [optimal solution found]
3.99/4.09 c Solving Time (sec) : 3.54
3.99/4.09 c Solving Nodes : 19105
3.99/4.09 c Primal Bound : +3.00000000000000e+00 (3 solutions)
3.99/4.09 c Dual Bound : +3.00000000000000e+00
3.99/4.09 c Gap : 0.00 %
3.99/4.09 s OPTIMUM FOUND
3.99/4.09 v x90 -x89 -x88 -x87 x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 x60 x59 x58 x57 x56 x55 -x78 -x77 -x76 -x75 -x74 -x73 -x54 x53 -x52 x51
3.99/4.09 v -x50 x49 -x72 -x71 -x70 -x69 x68 -x67 -x48 -x47 -x46 x45 x44 x43 -x66 -x65 -x64 -x63 -x62 -x61 -x42 x41 x40 -x39 x38 x37 x36
3.99/4.09 v -x35 -x34 -x33 x32 x31 -x30 -x29 -x28 -x27 x26 x25 -x24 -x23 -x22 -x21 x20 x19 -x18 -x17 -x16 x15 -x14 x13 -x12 -x11 x10 -x9
3.99/4.09 v -x8 x7 -x6 -x5 -x4 -x3 x2 x1
3.99/4.09 c SCIP Status : problem is solved [optimal solution found]
3.99/4.09 c Solving Time : 3.54
3.99/4.09 c Original Problem :
3.99/4.09 c Problem name : HOME/instance-2663721-1276650857.opb
3.99/4.09 c Variables : 270 (270 binary, 0 integer, 0 implicit integer, 0 continuous)
3.99/4.09 c Constraints : 191 initial, 191 maximal
3.99/4.09 c Presolved Problem :
3.99/4.09 c Problem name : t_HOME/instance-2663721-1276650857.opb
3.99/4.09 c Variables : 205 (205 binary, 0 integer, 0 implicit integer, 0 continuous)
3.99/4.09 c Constraints : 136 initial, 1192 maximal
3.99/4.09 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.99/4.09 c trivial : 0.00 0 0 0 0 0 0 0 0
3.99/4.09 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.99/4.09 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.99/4.09 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.99/4.09 c implics : 0.00 0 0 0 0 0 0 0 0
3.99/4.09 c probing : 0.02 0 0 0 0 0 0 0 0
3.99/4.09 c and : 0.01 10 50 0 0 0 50 0 50
3.99/4.09 c linear : 0.00 1 4 0 0 0 0 0 24
3.99/4.09 c logicor : 0.00 0 0 0 0 0 0 0 0
3.99/4.09 c root node : - 38 - - 38 - - - -
3.99/4.09 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.99/4.09 c integral : 0 0 0 0 0 0 0 0 0 0
3.99/4.09 c and : 125 0 50519 0 17088 473 81876 0 0 0
3.99/4.09 c linear : 5 0 50044 0 17088 1997 36887 0 0 0
3.99/4.09 c logicor : 6+ 0 24133 0 17087 358 8197 0 0 0
3.99/4.09 c countsols : 0 0 0 0 17091 0 0 0 0 0
3.99/4.09 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.99/4.09 c integral : 0.00 0.00 0.00 0.00 0.00
3.99/4.09 c and : 0.39 0.00 0.31 0.00 0.08
3.99/4.09 c linear : 0.90 0.00 0.86 0.00 0.04
3.99/4.09 c logicor : 0.29 0.00 0.24 0.00 0.05
3.99/4.09 c countsols : 0.00 0.00 0.00 0.00 0.00
3.99/4.09 c Propagators : Time Calls Cutoffs DomReds
3.99/4.09 c vbounds : 0.04 2 0 0
3.99/4.09 c rootredcost : 0.03 0 0 0
3.99/4.09 c pseudoobj : 0.08 50234 16 2067
3.99/4.09 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.99/4.09 c propagation : 0.27 2844 2745 20744 31.4 191 23.7 -
3.99/4.09 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
3.99/4.09 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.99/4.09 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.99/4.09 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.99/4.09 c applied globally : - - - 3586 14.7 - - -
3.99/4.09 c applied locally : - - - 140 42.4 - - -
3.99/4.09 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.99/4.09 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
3.99/4.09 c redcost : 0.00 0 0 0 0 0
3.99/4.09 c impliedbounds : 0.00 0 0 0 0 0
3.99/4.09 c intobj : 0.00 0 0 0 0 0
3.99/4.09 c cgmip : 0.00 0 0 0 0 0
3.99/4.09 c gomory : 0.00 0 0 0 0 0
3.99/4.09 c strongcg : 0.00 0 0 0 0 0
3.99/4.09 c cmir : 0.00 0 0 0 0 0
3.99/4.09 c flowcover : 0.00 0 0 0 0 0
3.99/4.09 c clique : 0.00 0 0 0 0 0
3.99/4.09 c zerohalf : 0.00 0 0 0 0 0
3.99/4.09 c mcf : 0.00 0 0 0 0 0
3.99/4.09 c rapidlearning : 0.00 0 0 0 0 0
3.99/4.09 c Pricers : Time Calls Vars
3.99/4.09 c problem variables: 0.00 0 0
3.99/4.09 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.99/4.09 c relpscost : 0.00 0 0 0 0 0 0
3.99/4.09 c pscost : 0.00 0 0 0 0 0 0
3.99/4.09 c inference : 0.47 17088 0 0 0 0 34176
3.99/4.09 c mostinf : 0.00 0 0 0 0 0 0
3.99/4.09 c leastinf : 0.00 0 0 0 0 0 0
3.99/4.09 c fullstrong : 0.00 0 0 0 0 0 0
3.99/4.09 c allfullstrong : 0.00 0 0 0 0 0 0
3.99/4.09 c random : 0.00 0 0 0 0 0 0
3.99/4.09 c Primal Heuristics : Time Calls Found
3.99/4.09 c LP solutions : 0.00 - 0
3.99/4.09 c pseudo solutions : 0.02 - 3
3.99/4.09 c oneopt : 0.01 0 0
3.99/4.09 c trivial : 0.00 2 0
3.99/4.09 c simplerounding : 0.00 0 0
3.99/4.09 c zirounding : 0.00 0 0
3.99/4.09 c rounding : 0.00 0 0
3.99/4.09 c shifting : 0.00 0 0
3.99/4.09 c intshifting : 0.00 0 0
3.99/4.09 c twoopt : 0.00 0 0
3.99/4.09 c fixandinfer : 0.00 0 0
3.99/4.09 c feaspump : 0.00 0 0
3.99/4.09 c coefdiving : 0.00 0 0
3.99/4.09 c pscostdiving : 0.00 0 0
3.99/4.09 c fracdiving : 0.00 0 0
3.99/4.09 c veclendiving : 0.00 0 0
3.99/4.09 c intdiving : 0.00 0 0
3.99/4.09 c actconsdiving : 0.00 0 0
3.99/4.09 c objpscostdiving : 0.00 0 0
3.99/4.09 c rootsoldiving : 0.00 0 0
3.99/4.09 c linesearchdiving : 0.00 0 0
3.99/4.09 c guideddiving : 0.00 0 0
3.99/4.09 c octane : 0.00 0 0
3.99/4.09 c rens : 0.00 0 0
3.99/4.09 c rins : 0.00 0 0
3.99/4.09 c localbranching : 0.00 0 0
3.99/4.09 c mutation : 0.00 0 0
3.99/4.09 c crossover : 0.00 0 0
3.99/4.09 c dins : 0.00 0 0
3.99/4.09 c undercover : 0.00 0 0
3.99/4.09 c nlp : 0.01 0 0
3.99/4.09 c trysol : 0.02 0 0
3.99/4.09 c LP : Time Calls Iterations Iter/call Iter/sec
3.99/4.09 c primal LP : 0.00 0 0 0.00 -
3.99/4.09 c dual LP : 0.00 0 0 0.00 -
3.99/4.09 c lex dual LP : 0.00 0 0 0.00 -
3.99/4.09 c barrier LP : 0.00 0 0 0.00 -
3.99/4.09 c diving/probing LP: 0.00 0 0 0.00 -
3.99/4.09 c strong branching : 0.00 0 0 0.00 -
3.99/4.09 c (at root node) : - 0 0 0.00 -
3.99/4.09 c conflict analysis: 0.00 0 0 0.00 -
3.99/4.09 c B&B Tree :
3.99/4.09 c number of runs : 1
3.99/4.09 c nodes : 19105
3.99/4.09 c nodes (total) : 19105
3.99/4.09 c nodes left : 0
3.99/4.09 c max depth : 72
3.99/4.09 c max depth (total): 72
3.99/4.09 c backtracks : 2428 (12.7%)
3.99/4.09 c delayed cutoffs : 5879
3.99/4.09 c repropagations : 4027 (13452 domain reductions, 830 cutoffs)
3.99/4.09 c avg switch length: 4.48
3.99/4.09 c switching time : 0.60
3.99/4.09 c Solution :
3.99/4.09 c Solutions found : 3 (3 improvements)
3.99/4.09 c First Solution : +2.50000000000000e+01 (in run 1, after 5923 nodes, 0.95 seconds, depth 30, found by <relaxation>)
3.99/4.09 c Primal Bound : +3.00000000000000e+00 (in run 1, after 19105 nodes, 3.51 seconds, depth 38, found by <relaxation>)
3.99/4.09 c Dual Bound : +3.00000000000000e+00
3.99/4.09 c Gap : 0.00 %
3.99/4.09 c Root Dual Bound : +1.00000000000000e+00
3.99/4.09 c Root Iterations : 0
3.99/4.10 c Time complete: 4.09.