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-2663533-1276646538.opb>
0.00/0.01 c original problem has 324 variables (324 bin, 0 int, 0 impl, 0 cont) and 250 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.01/0.04 c (round 1) 3 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 28 chg coeffs, 0 upgd conss, 1092 impls, 0 clqs
0.01/0.05 c (round 2) 21 del vars, 16 del conss, 0 chg bounds, 0 chg sides, 44 chg coeffs, 4 upgd conss, 1668 impls, 0 clqs
0.01/0.05 c (round 3) 39 del vars, 32 del conss, 0 chg bounds, 0 chg sides, 60 chg coeffs, 4 upgd conss, 1956 impls, 0 clqs
0.01/0.06 c (round 4) 57 del vars, 48 del conss, 0 chg bounds, 0 chg sides, 76 chg coeffs, 4 upgd conss, 1956 impls, 0 clqs
0.01/0.07 c (0.0s) probing: 142/267 (53.2%) - 0 fixings, 0 aggregations, 6 implications, 0 bound changes
0.01/0.07 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.01/0.07 c presolving (5 rounds):
0.01/0.07 c 57 deleted vars, 48 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 76 changed coefficients
0.01/0.07 c 1968 implications, 0 cliques
0.01/0.07 c presolved problem has 267 variables (267 bin, 0 int, 0 impl, 0 cont) and 199 constraints
0.01/0.07 c 192 constraints of type <and>
0.01/0.07 c 3 constraints of type <linear>
0.01/0.07 c 4 constraints of type <logicor>
0.01/0.07 c transformed objective value is always integral (scale: 2)
0.01/0.07 c Presolving Time: 0.03
0.01/0.07 c - non default parameters ----------------------------------------------------------------------
0.01/0.07 c # SCIP version 1.2.1.2
0.01/0.07 c
0.01/0.07 c # frequency for displaying node information lines
0.01/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.07 c display/freq = 10000
0.01/0.07 c
0.01/0.07 c # maximal time in seconds to run
0.01/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.07 c limits/time = 1800
0.01/0.07 c
0.01/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.07 c limits/memory = 1620
0.01/0.07 c
0.01/0.07 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.01/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.07 c lp/solvefreq = -1
0.01/0.07 c
0.01/0.07 c # should presolving try to simplify inequalities
0.01/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.07 c constraints/linear/simplifyinequalities = TRUE
0.01/0.07 c
0.01/0.07 c # should presolving try to simplify knapsacks
0.01/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.07 c
0.01/0.07 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.01/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.07 c heuristics/undercover/freq = 0
0.01/0.07 c
0.01/0.07 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.07 c separating/rapidlearning/freq = 0
0.01/0.07 c
0.01/0.07 c -----------------------------------------------------------------------------------------------
0.01/0.07 c start solving
0.01/0.07 c
0.01/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.01/0.08 c 0.0s| 1 | 2 | 0 | - | 896k| 0 | - | 267 | 199 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | -- | Inf
1.50/1.52 o 205
1.50/1.52 c * 1.3s| 8534 | 5823 | 0 | 0.0 |4986k| 136 | - | 267 | 302 | 0 | 0 | 0 | 533 | 0 | 1.000000e+00 | 2.050000e+02 | Large
1.69/1.80 c 1.5s| 10000 | 6727 | 0 | 0.0 |5625k| 136 | - | 267 | 285 | 0 | 0 | 0 | 661 | 0 | 1.000000e+00 | 2.050000e+02 | Large
2.10/2.19 o 171
2.10/2.19 c * 1.9s| 12105 | 7929 | 0 | 0.0 |6497k| 136 | - | 267 | 335 | 0 | 0 | 0 | 867 | 0 | 1.000000e+00 | 1.710000e+02 | Large
3.59/3.67 c 3.2s| 20000 | 12622 | 0 | 0.0 |9850k| 136 | - | 267 | 519 | 0 | 0 | 0 |1702 | 0 | 1.000000e+00 | 1.710000e+02 | Large
3.79/3.89 o 23
3.79/3.89 c * 3.4s| 21145 | 10438 | 0 | 0.0 |8892k| 136 | - | 267 | 554 | 0 | 0 | 0 |1833 | 0 | 1.000000e+00 | 2.300000e+01 |2200.00%
4.99/5.02 o 3
4.99/5.02 c * 4.4s| 26678 | 11023 | 0 | 0.0 |9406k| 136 | - | 267 | 322 | 0 | 0 | 0 |2482 | 0 | 1.000000e+00 | 3.000000e+00 | 200.00%
4.99/5.09 c
4.99/5.09 c SCIP Status : problem is solved [optimal solution found]
4.99/5.09 c Solving Time (sec) : 4.42
4.99/5.09 c Solving Nodes : 26678
4.99/5.09 c Primal Bound : +3.00000000000000e+00 (4 solutions)
4.99/5.09 c Dual Bound : +3.00000000000000e+00
4.99/5.09 c Gap : 0.00 %
4.99/5.09 s OPTIMUM FOUND
4.99/5.09 v -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 x64 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47
4.99/5.09 v x46 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x45 -x44 -x43 x42 x41 x40 -x39 -x38 x37 x36 x35 x34 x33 -x32 -x31 -x30 -x29
4.99/5.09 v x28 -x27 -x26 -x25 -x24 -x23 x22 -x21 -x20 x19 -x18 -x17 -x16 -x15 x14 -x13 -x12 x11 x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 x1
4.99/5.09 c SCIP Status : problem is solved [optimal solution found]
4.99/5.09 c Solving Time : 4.42
4.99/5.09 c Original Problem :
4.99/5.09 c Problem name : HOME/instance-2663533-1276646538.opb
4.99/5.09 c Variables : 324 (324 binary, 0 integer, 0 implicit integer, 0 continuous)
4.99/5.09 c Constraints : 250 initial, 250 maximal
4.99/5.09 c Presolved Problem :
4.99/5.09 c Problem name : t_HOME/instance-2663533-1276646538.opb
4.99/5.09 c Variables : 267 (267 binary, 0 integer, 0 implicit integer, 0 continuous)
4.99/5.09 c Constraints : 199 initial, 812 maximal
4.99/5.09 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
4.99/5.09 c trivial : 0.00 0 0 0 0 0 0 0 0
4.99/5.09 c dualfix : 0.00 0 0 0 0 0 0 0 0
4.99/5.09 c boundshift : 0.00 0 0 0 0 0 0 0 0
4.99/5.09 c inttobinary : 0.00 0 0 0 0 0 0 0 0
4.99/5.09 c implics : 0.00 0 0 0 0 0 0 0 0
4.99/5.09 c probing : 0.01 0 0 0 0 0 0 0 0
4.99/5.09 c and : 0.01 6 48 0 0 0 48 0 48
4.99/5.09 c linear : 0.00 1 2 0 0 0 0 0 28
4.99/5.09 c logicor : 0.00 0 0 0 0 0 0 0 0
4.99/5.09 c root node : - 81 - - 81 - - - -
4.99/5.09 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
4.99/5.09 c integral : 0 0 0 0 0 0 0 0 0 0
4.99/5.09 c and : 192 0 57027 0 21875 881 115975 0 0 0
4.99/5.09 c linear : 3 0 56145 0 21875 4217 41192 0 0 0
4.99/5.09 c logicor : 4+ 0 23443 0 21757 282 3602 0 0 0
4.99/5.09 c countsols : 0 0 0 0 21879 0 0 0 0 0
4.99/5.09 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
4.99/5.09 c integral : 0.00 0.00 0.00 0.00 0.00
4.99/5.09 c and : 0.77 0.00 0.59 0.00 0.18
4.99/5.09 c linear : 1.20 0.00 1.18 0.00 0.02
4.99/5.09 c logicor : 0.31 0.00 0.22 0.00 0.09
4.99/5.09 c countsols : 0.00 0.00 0.00 0.00 0.00
4.99/5.09 c Propagators : Time Calls Cutoffs DomReds
4.99/5.09 c vbounds : 0.03 2 0 0
4.99/5.09 c rootredcost : 0.04 0 0 0
4.99/5.09 c pseudoobj : 0.03 56805 62 877
4.99/5.09 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
4.99/5.09 c propagation : 0.39 1975 1974 17401 49.3 242 51.2 -
4.99/5.09 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
4.99/5.09 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
4.99/5.09 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
4.99/5.09 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
4.99/5.09 c applied globally : - - - 2403 17.7 - - -
4.99/5.09 c applied locally : - - - 80 48.4 - - -
4.99/5.09 c Separators : Time Calls Cutoffs DomReds Cuts Conss
4.99/5.09 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
4.99/5.09 c redcost : 0.00 0 0 0 0 0
4.99/5.09 c impliedbounds : 0.00 0 0 0 0 0
4.99/5.09 c intobj : 0.00 0 0 0 0 0
4.99/5.09 c cgmip : 0.00 0 0 0 0 0
4.99/5.09 c gomory : 0.00 0 0 0 0 0
4.99/5.09 c strongcg : 0.00 0 0 0 0 0
4.99/5.09 c cmir : 0.00 0 0 0 0 0
4.99/5.09 c flowcover : 0.00 0 0 0 0 0
4.99/5.09 c clique : 0.00 0 0 0 0 0
4.99/5.09 c zerohalf : 0.00 0 0 0 0 0
4.99/5.09 c mcf : 0.00 0 0 0 0 0
4.99/5.09 c rapidlearning : 0.00 0 0 0 0 0
4.99/5.09 c Pricers : Time Calls Vars
4.99/5.09 c problem variables: 0.00 0 0
4.99/5.09 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
4.99/5.09 c relpscost : 0.00 0 0 0 0 0 0
4.99/5.09 c pscost : 0.00 0 0 0 0 0 0
4.99/5.09 c inference : 0.46 21875 0 0 0 0 43750
4.99/5.09 c mostinf : 0.00 0 0 0 0 0 0
4.99/5.09 c leastinf : 0.00 0 0 0 0 0 0
4.99/5.09 c fullstrong : 0.00 0 0 0 0 0 0
4.99/5.09 c allfullstrong : 0.00 0 0 0 0 0 0
4.99/5.09 c random : 0.00 0 0 0 0 0 0
4.99/5.09 c Primal Heuristics : Time Calls Found
4.99/5.09 c LP solutions : 0.00 - 0
4.99/5.09 c pseudo solutions : 0.01 - 4
4.99/5.09 c oneopt : 0.03 0 0
4.99/5.09 c trivial : 0.00 2 0
4.99/5.09 c simplerounding : 0.00 0 0
4.99/5.09 c zirounding : 0.00 0 0
4.99/5.09 c rounding : 0.00 0 0
4.99/5.09 c shifting : 0.00 0 0
4.99/5.09 c intshifting : 0.00 0 0
4.99/5.09 c twoopt : 0.00 0 0
4.99/5.09 c fixandinfer : 0.00 0 0
4.99/5.09 c feaspump : 0.00 0 0
4.99/5.09 c coefdiving : 0.00 0 0
4.99/5.09 c pscostdiving : 0.00 0 0
4.99/5.09 c fracdiving : 0.00 0 0
4.99/5.09 c veclendiving : 0.00 0 0
4.99/5.09 c intdiving : 0.00 0 0
4.99/5.09 c actconsdiving : 0.00 0 0
4.99/5.09 c objpscostdiving : 0.00 0 0
4.99/5.09 c rootsoldiving : 0.00 0 0
4.99/5.09 c linesearchdiving : 0.00 0 0
4.99/5.09 c guideddiving : 0.00 0 0
4.99/5.09 c octane : 0.00 0 0
4.99/5.09 c rens : 0.00 0 0
4.99/5.09 c rins : 0.00 0 0
4.99/5.09 c localbranching : 0.00 0 0
4.99/5.09 c mutation : 0.00 0 0
4.99/5.09 c crossover : 0.00 0 0
4.99/5.09 c dins : 0.00 0 0
4.99/5.09 c undercover : 0.00 0 0
4.99/5.09 c nlp : 0.00 0 0
4.99/5.09 c trysol : 0.02 0 0
4.99/5.09 c LP : Time Calls Iterations Iter/call Iter/sec
4.99/5.09 c primal LP : 0.00 0 0 0.00 -
4.99/5.09 c dual LP : 0.00 0 0 0.00 -
4.99/5.09 c lex dual LP : 0.00 0 0 0.00 -
4.99/5.09 c barrier LP : 0.00 0 0 0.00 -
4.99/5.09 c diving/probing LP: 0.00 0 0 0.00 -
4.99/5.09 c strong branching : 0.00 0 0 0.00 -
4.99/5.09 c (at root node) : - 0 0 0.00 -
4.99/5.09 c conflict analysis: 0.00 0 0 0.00 -
4.99/5.09 c B&B Tree :
4.99/5.09 c number of runs : 1
4.99/5.09 c nodes : 26678
4.99/5.09 c nodes (total) : 26678
4.99/5.09 c nodes left : 0
4.99/5.09 c max depth : 136
4.99/5.09 c max depth (total): 136
4.99/5.09 c backtracks : 2260 (8.5%)
4.99/5.09 c delayed cutoffs : 11967
4.99/5.09 c repropagations : 4291 (12132 domain reductions, 643 cutoffs)
4.99/5.09 c avg switch length: 4.50
4.99/5.09 c switching time : 0.71
4.99/5.09 c Solution :
4.99/5.09 c Solutions found : 4 (4 improvements)
4.99/5.09 c First Solution : +2.05000000000000e+02 (in run 1, after 8534 nodes, 1.30 seconds, depth 41, found by <relaxation>)
4.99/5.09 c Primal Bound : +3.00000000000000e+00 (in run 1, after 26678 nodes, 4.36 seconds, depth 25, found by <relaxation>)
4.99/5.09 c Dual Bound : +3.00000000000000e+00
4.99/5.09 c Gap : 0.00 %
4.99/5.09 c Root Dual Bound : +1.00000000000000e+00
4.99/5.09 c Root Iterations : 0
5.09/5.10 c Time complete: 5.09.