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-2664789-1276595305.opb>
0.00/0.01 c original problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 50 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 o 100
0.00/0.01 c feasible solution found by trivial heuristic, objective value 1.000000e+02
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 50 upgd conss, 0 impls, 0 clqs
0.00/0.02 c presolving (2 rounds):
0.00/0.02 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 0 implications, 0 cliques
0.00/0.02 c presolved problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.00/0.02 c 50 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.00
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c # SCIP version 1.2.1.2
0.00/0.02 c
0.00/0.02 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c conflict/interconss = 0
0.00/0.02 c
0.00/0.02 c # should binary conflicts be preferred?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c conflict/preferbinary = TRUE
0.00/0.02 c
0.00/0.02 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c constraints/agelimit = 1
0.00/0.02 c
0.00/0.02 c # should enforcement of pseudo solution be disabled?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/disableenfops = TRUE
0.00/0.02 c
0.00/0.02 c # frequency for displaying node information lines
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02 c display/freq = 10000
0.00/0.02 c
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = 1800
0.00/0.02 c
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = 1620
0.00/0.02 c
0.00/0.02 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c lp/solvefreq = -1
0.00/0.02 c
0.00/0.02 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.02 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.02 c lp/pricing = a
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify inequalities
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/linear/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify knapsacks
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # priority of node selection rule <dfs> in standard mode
0.00/0.02 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.02 c nodeselection/dfs/stdpriority = 1000000
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving
0.00/0.02 c
0.00/0.02 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.02 c t 0.0s| 1 | 2 | 0 | - | 404k| 0 | - | 100 | 50 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | 1.000000e+02 | Inf
0.00/0.03 o 7
0.00/0.03 c * 0.0s| 94 | 90 | 0 | 0.0 | 428k| 93 | - | 100 | 50 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | 7.000000e+00 | 600.00%
0.00/0.03 o 6
0.00/0.03 c * 0.0s| 100 | 89 | 0 | 0.0 | 432k| 93 | - | 100 | 50 | 0 | 0 | 0 | 1 | 0 | 1.000000e+00 | 6.000000e+00 | 500.00%
0.00/0.03 o 5
0.00/0.03 c * 0.0s| 112 | 89 | 0 | 0.0 | 436k| 93 | - | 100 | 50 | 0 | 0 | 0 | 6 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
1.19/1.25 c 1.1s| 10000 | 74 | 0 | 0.0 | 461k| 93 | - | 100 | 59 | 0 | 0 | 0 |5730 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
2.39/2.46 c 2.1s| 20000 | 72 | 0 | 0.0 | 465k| 93 | - | 100 | 55 | 0 | 0 | 0 | 11k| 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
3.69/3.70 c 3.2s| 30000 | 58 | 0 | 0.0 | 464k| 95 | - | 100 | 52 | 0 | 0 | 0 | 17k| 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
4.49/4.59 o 4
4.49/4.59 c * 4.0s| 37293 | 57 | 0 | 0.0 | 471k| 95 | - | 100 | 54 | 0 | 0 | 0 | 21k| 0 | 1.000000e+00 | 4.000000e+00 | 300.00%
4.89/4.93 c 4.3s| 40000 | 64 | 0 | 0.0 | 473k| 95 | - | 100 | 53 | 0 | 0 | 0 | 22k| 0 | 1.000000e+00 | 4.000000e+00 | 300.00%
6.09/6.19 c 5.4s| 50000 | 59 | 0 | 0.0 | 488k| 95 | - | 100 | 64 | 0 | 0 | 0 | 27k| 0 | 1.000000e+00 | 4.000000e+00 | 300.00%
7.39/7.49 c 6.5s| 60000 | 59 | 0 | 0.0 | 488k| 95 | - | 100 | 51 | 0 | 0 | 0 | 33k| 0 | 1.000000e+00 | 4.000000e+00 | 300.00%
8.79/8.85 c 7.7s| 70000 | 65 | 0 | 0.0 | 500k| 95 | - | 100 | 56 | 0 | 0 | 0 | 38k| 0 | 1.000000e+00 | 4.000000e+00 | 300.00%
10.09/10.16 c 8.9s| 80000 | 39 | 0 | 0.0 | 497k| 95 | - | 100 | 55 | 0 | 0 | 0 | 43k| 0 | 1.000000e+00 | 4.000000e+00 | 300.00%
11.59/11.62 c 10.2s| 90000 | 64 | 0 | 0.0 | 508k| 95 | - | 100 | 53 | 0 | 0 | 0 | 48k| 0 | 1.000000e+00 | 4.000000e+00 | 300.00%
12.99/13.01 c 11.4s|100000 | 41 | 0 | 0.0 | 508k| 95 | - | 100 | 53 | 0 | 0 | 0 | 54k| 0 | 1.000000e+00 | 4.000000e+00 | 300.00%
14.48/14.52 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
14.48/14.52 c 12.7s|110000 | 48 | 0 | 0.0 | 515k| 95 | - | 100 | 54 | 0 | 0 | 0 | 59k| 0 | 1.000000e+00 | 4.000000e+00 | 300.00%
15.89/15.99 c 14.0s|120000 | 48 | 0 | 0.0 | 515k| 95 | - | 100 | 50 | 0 | 0 | 0 | 64k| 0 | 1.000000e+00 | 4.000000e+00 | 300.00%
17.49/17.50 c 15.4s|130000 | 63 | 0 | 0.0 | 522k| 95 | - | 100 | 53 | 0 | 0 | 0 | 69k| 0 | 2.000000e+00 | 4.000000e+00 | 100.00%
17.59/17.61 c
17.59/17.61 c SCIP Status : problem is solved [optimal solution found]
17.59/17.61 c Solving Time (sec) : 15.46
17.59/17.61 c Solving Nodes : 130777
17.59/17.61 c Primal Bound : +4.00000000000000e+00 (7 solutions)
17.59/17.61 c Dual Bound : +4.00000000000000e+00
17.59/17.61 c Gap : 0.00 %
17.59/17.61 s OPTIMUM FOUND
17.59/17.61 v -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75
17.59/17.61 v -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50
17.59/17.61 v -x49 -x48 -x47 -x46 -x45 -x44 -x43 x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 x32 -x31 -x30 -x29 x28 -x27 -x26 -x25
17.59/17.61 v -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
17.59/17.61 c SCIP Status : problem is solved [optimal solution found]
17.59/17.61 c Solving Time : 15.46
17.59/17.61 c Original Problem :
17.59/17.61 c Problem name : HOME/instance-2664789-1276595305.opb
17.59/17.61 c Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous)
17.59/17.61 c Constraints : 50 initial, 50 maximal
17.59/17.61 c Presolved Problem :
17.59/17.61 c Problem name : t_HOME/instance-2664789-1276595305.opb
17.59/17.61 c Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous)
17.59/17.61 c Constraints : 50 initial, 81 maximal
17.59/17.61 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
17.59/17.61 c trivial : 0.00 0 0 0 0 0 0 0 0
17.59/17.61 c dualfix : 0.00 0 0 0 0 0 0 0 0
17.59/17.61 c boundshift : 0.00 0 0 0 0 0 0 0 0
17.59/17.61 c inttobinary : 0.00 0 0 0 0 0 0 0 0
17.59/17.61 c implics : 0.00 0 0 0 0 0 0 0 0
17.59/17.61 c probing : 0.00 0 0 0 0 0 0 0 0
17.59/17.61 c logicor : 0.00 0 0 0 0 0 0 0 0
17.59/17.61 c root node : - 100 - - 100 - - - -
17.59/17.61 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
17.59/17.61 c integral : 0 0 0 0 0 0 0 0 0 0
17.59/17.61 c logicor : 50+ 0 162130 0 3 69604 64113 0 0 0
17.59/17.61 c countsols : 0 0 0 0 4 0 0 0 0 0
17.59/17.61 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
17.59/17.61 c integral : 0.00 0.00 0.00 0.00 0.00
17.59/17.61 c logicor : 3.51 0.00 3.51 0.00 0.00
17.59/17.61 c countsols : 0.00 0.00 0.00 0.00 0.00
17.59/17.61 c Propagators : Time Calls Cutoffs DomReds
17.59/17.61 c vbounds : 0.17 2 0 0
17.59/17.61 c rootredcost : 0.19 0 0 0
17.59/17.61 c pseudoobj : 4.78 306692 489 2641287
17.59/17.61 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
17.59/17.61 c propagation : 2.47 70093 70082 70082 29.4 51 59.1 -
17.59/17.61 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
17.59/17.61 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
17.59/17.61 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
17.59/17.61 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
17.59/17.61 c applied globally : - - - 48144 22.6 - - -
17.59/17.61 c applied locally : - - - 21938 44.3 - - -
17.59/17.61 c Separators : Time Calls Cutoffs DomReds Cuts Conss
17.59/17.61 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
17.59/17.61 c redcost : 0.00 0 0 0 0 0
17.59/17.61 c impliedbounds : 0.00 0 0 0 0 0
17.59/17.61 c intobj : 0.00 0 0 0 0 0
17.59/17.61 c cgmip : 0.00 0 0 0 0 0
17.59/17.62 c gomory : 0.00 0 0 0 0 0
17.59/17.62 c strongcg : 0.00 0 0 0 0 0
17.59/17.62 c cmir : 0.00 0 0 0 0 0
17.59/17.62 c flowcover : 0.00 0 0 0 0 0
17.59/17.62 c clique : 0.00 0 0 0 0 0
17.59/17.62 c zerohalf : 0.00 0 0 0 0 0
17.59/17.62 c mcf : 0.00 0 0 0 0 0
17.59/17.62 c rapidlearning : 0.00 0 0 0 0 0
17.59/17.62 c Pricers : Time Calls Vars
17.59/17.62 c problem variables: 0.00 0 0
17.59/17.62 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
17.59/17.62 c relpscost : 0.00 0 0 0 0 0 0
17.59/17.62 c pscost : 0.00 0 0 0 0 0 0
17.59/17.62 c inference : 0.79 78942 0 0 0 0 157884
17.59/17.62 c mostinf : 0.00 0 0 0 0 0 0
17.59/17.62 c leastinf : 0.00 0 0 0 0 0 0
17.59/17.62 c fullstrong : 0.00 0 0 0 0 0 0
17.59/17.62 c allfullstrong : 0.00 0 0 0 0 0 0
17.59/17.62 c random : 0.00 0 0 0 0 0 0
17.59/17.62 c Primal Heuristics : Time Calls Found
17.59/17.62 c LP solutions : 0.00 - 0
17.59/17.62 c pseudo solutions : 0.00 - 4
17.59/17.62 c oneopt : 0.06 0 0
17.59/17.62 c trivial : 0.00 2 3
17.59/17.62 c simplerounding : 0.00 0 0
17.59/17.62 c zirounding : 0.00 0 0
17.59/17.62 c rounding : 0.00 0 0
17.59/17.62 c shifting : 0.00 0 0
17.59/17.62 c intshifting : 0.00 0 0
17.59/17.62 c twoopt : 0.00 0 0
17.59/17.62 c fixandinfer : 0.00 0 0
17.59/17.62 c feaspump : 0.00 0 0
17.59/17.62 c coefdiving : 0.00 0 0
17.59/17.62 c pscostdiving : 0.00 0 0
17.59/17.62 c fracdiving : 0.00 0 0
17.59/17.62 c veclendiving : 0.00 0 0
17.59/17.62 c intdiving : 0.00 0 0
17.59/17.62 c actconsdiving : 0.00 0 0
17.59/17.62 c objpscostdiving : 0.00 0 0
17.59/17.62 c rootsoldiving : 0.00 0 0
17.59/17.62 c linesearchdiving : 0.00 0 0
17.59/17.62 c guideddiving : 0.00 0 0
17.59/17.62 c octane : 0.00 0 0
17.59/17.62 c rens : 0.00 0 0
17.59/17.62 c rins : 0.00 0 0
17.59/17.62 c localbranching : 0.00 0 0
17.59/17.62 c mutation : 0.00 0 0
17.59/17.62 c crossover : 0.00 0 0
17.59/17.62 c dins : 0.00 0 0
17.59/17.62 c undercover : 0.00 0 0
17.59/17.62 c nlp : 0.07 0 0
17.59/17.62 c trysol : 0.09 0 0
17.59/17.62 c LP : Time Calls Iterations Iter/call Iter/sec
17.59/17.62 c primal LP : 0.00 0 0 0.00 -
17.59/17.62 c dual LP : 0.00 0 0 0.00 -
17.59/17.62 c lex dual LP : 0.00 0 0 0.00 -
17.59/17.62 c barrier LP : 0.00 0 0 0.00 -
17.59/17.62 c diving/probing LP: 0.00 0 0 0.00 -
17.59/17.62 c strong branching : 0.00 0 0 0.00 -
17.59/17.62 c (at root node) : - 0 0 0.00 -
17.59/17.62 c conflict analysis: 0.00 0 0 0.00 -
17.59/17.62 c B&B Tree :
17.59/17.62 c number of runs : 1
17.59/17.62 c nodes : 130777
17.59/17.62 c nodes (total) : 130777
17.59/17.62 c nodes left : 0
17.59/17.62 c max depth : 95
17.59/17.62 c max depth (total): 95
17.59/17.62 c backtracks : 64667 (49.4%)
17.59/17.62 c delayed cutoffs : 27092
17.59/17.62 c repropagations : 117462 (546447 domain reductions, 18262 cutoffs)
17.59/17.62 c avg switch length: 3.09
17.59/17.62 c switching time : 2.00
17.59/17.62 c Solution :
17.59/17.62 c Solutions found : 7 (5 improvements)
17.59/17.62 c First Solution : +1.00000000000000e+02 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
17.59/17.62 c Primal Bound : +4.00000000000000e+00 (in run 1, after 37293 nodes, 3.96 seconds, depth 70, found by <relaxation>)
17.59/17.62 c Dual Bound : +4.00000000000000e+00
17.59/17.62 c Gap : 0.00 %
17.59/17.62 c Root Dual Bound : +0.00000000000000e+00
17.59/17.62 c Root Iterations : 0
17.59/17.62 c Time complete: 17.61.