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-2664654-1276427828.opb>
0.00/0.10 c original problem has 2786 variables (2786 bin, 0 int, 0 impl, 0 cont) and 4827 constraints
0.00/0.10 c problem read
0.00/0.10 c presolving settings loaded
0.00/0.10 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.10/0.13 c presolving:
0.19/0.23 c (round 1) 2010 del vars, 514 del conss, 9 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 79634 impls, 0 clqs
0.19/0.27 c (round 2) 2087 del vars, 3105 del conss, 37 chg bounds, 12 chg sides, 36 chg coeffs, 0 upgd conss, 81605 impls, 0 clqs
0.19/0.28 c (round 3) 2124 del vars, 3266 del conss, 57 chg bounds, 12 chg sides, 36 chg coeffs, 0 upgd conss, 81723 impls, 0 clqs
0.19/0.28 c (round 4) 2133 del vars, 3304 del conss, 60 chg bounds, 12 chg sides, 36 chg coeffs, 0 upgd conss, 81765 impls, 0 clqs
0.19/0.29 c (round 5) 2139 del vars, 3318 del conss, 63 chg bounds, 12 chg sides, 36 chg coeffs, 0 upgd conss, 81765 impls, 0 clqs
0.19/0.29 c (round 6) 2140 del vars, 3319 del conss, 64 chg bounds, 12 chg sides, 36 chg coeffs, 0 upgd conss, 81765 impls, 0 clqs
0.29/0.37 c (round 7) 2140 del vars, 3399 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 0 upgd conss, 81769 impls, 0 clqs
0.29/0.37 c (round 8) 2142 del vars, 3400 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 0 upgd conss, 81769 impls, 0 clqs
0.39/0.44 c (round 9) 2142 del vars, 3435 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 1349 upgd conss, 81769 impls, 0 clqs
0.39/0.45 c (round 10) 2142 del vars, 3435 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 81769 impls, 0 clqs
0.49/0.50 c (round 11) 2192 del vars, 3435 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 84291 impls, 0 clqs
0.49/0.54 c (round 12) 2242 del vars, 3435 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 85359 impls, 0 clqs
0.49/0.54 c (round 13) 2242 del vars, 3458 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 85359 impls, 0 clqs
0.49/0.56 c (round 14) 2292 del vars, 3458 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 85633 impls, 0 clqs
0.49/0.56 c (round 15) 2293 del vars, 3483 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 85641 impls, 0 clqs
0.59/0.61 c (0.5s) probing: 613/642 (95.5%) - 22 fixings, 168 aggregations, 1515 implications, 0 bound changes
0.59/0.61 c (0.5s) probing aborted: 100/100 successive totally useless probings
0.59/0.61 c (round 16) 2333 del vars, 3483 del conss, 64 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 85893 impls, 0 clqs
0.59/0.61 c (round 17) 2336 del vars, 3491 del conss, 66 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 85917 impls, 0 clqs
0.59/0.62 c (round 18) 2339 del vars, 3501 del conss, 66 chg bounds, 88 chg sides, 36 chg coeffs, 1427 upgd conss, 85945 impls, 0 clqs
0.59/0.63 c (0.5s) probing: 623/642 (97.0%) - 22 fixings, 168 aggregations, 1515 implications, 0 bound changes
0.59/0.63 c (0.5s) probing aborted: 100/100 successive totally useless probings
0.59/0.63 c presolving (19 rounds):
0.59/0.63 c 2339 deleted vars, 3501 deleted constraints, 66 tightened bounds, 0 added holes, 88 changed sides, 36 changed coefficients
0.59/0.63 c 85945 implications, 0 cliques
0.59/0.63 c presolved problem has 445 variables (445 bin, 0 int, 0 impl, 0 cont) and 1326 constraints
0.59/0.63 c 1326 constraints of type <logicor>
0.59/0.63 c transformed objective value is always integral (scale: 1)
0.59/0.63 c Presolving Time: 0.45
0.59/0.63 c - non default parameters ----------------------------------------------------------------------
0.59/0.63 c # SCIP version 1.2.1.2
0.59/0.63 c
0.59/0.63 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.63 c conflict/interconss = 0
0.59/0.63 c
0.59/0.63 c # should binary conflicts be preferred?
0.59/0.63 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.63 c conflict/preferbinary = TRUE
0.59/0.63 c
0.59/0.63 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.63 c constraints/agelimit = 1
0.59/0.63 c
0.59/0.63 c # should enforcement of pseudo solution be disabled?
0.59/0.63 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.63 c constraints/disableenfops = TRUE
0.59/0.63 c
0.59/0.63 c # frequency for displaying node information lines
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 100]
0.59/0.63 c display/freq = 10000
0.59/0.63 c
0.59/0.63 c # maximal time in seconds to run
0.59/0.63 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.59/0.63 c limits/time = 1799.91
0.59/0.63 c
0.59/0.63 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.59/0.63 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.59/0.63 c limits/memory = 1620
0.59/0.63 c
0.59/0.63 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.63 c lp/solvefreq = -1
0.59/0.63 c
0.59/0.63 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.59/0.63 c # [type: char, range: {lafpsqd}, default: l]
0.59/0.63 c lp/pricing = a
0.59/0.63 c
0.59/0.63 c # should presolving try to simplify inequalities
0.59/0.63 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.63 c constraints/linear/simplifyinequalities = TRUE
0.59/0.63 c
0.59/0.63 c # should presolving try to simplify knapsacks
0.59/0.63 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.63 c constraints/knapsack/simplifyinequalities = TRUE
0.59/0.63 c
0.59/0.63 c # priority of node selection rule <dfs> in standard mode
0.59/0.63 c # [type: int, range: [-536870912,536870911], default: 0]
0.59/0.63 c nodeselection/dfs/stdpriority = 1000000
0.59/0.63 c
0.59/0.63 c -----------------------------------------------------------------------------------------------
0.59/0.63 c start solving
0.59/0.63 c
0.59/0.64 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.59/0.64 c 0.5s| 1 | 2 | 0 | - |7597k| 0 | - | 445 |1326 | 0 | 0 | 0 | 0 | 0 | 1.273000e+03 | -- | Inf
0.59/0.65 c
0.59/0.65 c SCIP Status : problem is solved [infeasible]
0.59/0.65 c Solving Time (sec) : 0.48
0.59/0.65 c Solving Nodes : 33
0.59/0.65 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.59/0.65 c Dual Bound : +1.00000000000000e+20
0.59/0.65 c Gap : 0.00 %
0.59/0.65 s UNSATISFIABLE
0.59/0.65 c SCIP Status : problem is solved [infeasible]
0.59/0.65 c Solving Time : 0.48
0.59/0.65 c Original Problem :
0.59/0.65 c Problem name : HOME/instance-2664654-1276427828.opb
0.59/0.65 c Variables : 2786 (2786 binary, 0 integer, 0 implicit integer, 0 continuous)
0.59/0.65 c Constraints : 4827 initial, 4827 maximal
0.59/0.65 c Presolved Problem :
0.59/0.65 c Problem name : t_HOME/instance-2664654-1276427828.opb
0.59/0.65 c Variables : 445 (445 binary, 0 integer, 0 implicit integer, 0 continuous)
0.59/0.65 c Constraints : 1326 initial, 1329 maximal
0.59/0.65 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.59/0.65 c trivial : 0.00 4 0 0 0 0 0 0 0
0.59/0.65 c dualfix : 0.00 25 0 0 0 0 0 0 0
0.59/0.65 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.59/0.65 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.59/0.65 c implics : 0.07 0 1671 0 0 0 0 0 0
0.59/0.65 c probing : 0.12 22 168 0 0 0 0 0 0
0.59/0.65 c linear : 0.15 64 385 0 64 0 3400 88 36
0.59/0.65 c logicor : 0.08 0 0 0 2 0 101 0 0
0.59/0.65 c root node : - 8 - - 8 - - - -
0.59/0.65 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.59/0.65 c integral : 0 0 0 0 0 0 0 0 0 0
0.59/0.65 c logicor : 1326+ 0 1898 0 0 16 187 0 0 0
0.59/0.65 c countsols : 0 0 0 0 0 0 0 0 0 0
0.59/0.65 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.59/0.65 c integral : 0.00 0.00 0.00 0.00 0.00
0.59/0.65 c logicor : 0.01 0.00 0.01 0.00 0.00
0.59/0.65 c countsols : 0.00 0.00 0.00 0.00 0.00
0.59/0.65 c Propagators : Time Calls Cutoffs DomReds
0.59/0.65 c vbounds : 0.00 2 0 0
0.59/0.65 c rootredcost : 0.00 0 0 0
0.59/0.65 c pseudoobj : 0.00 124 0 0
0.59/0.65 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.59/0.65 c propagation : 0.00 5 4 4 1.5 0 0.0 -
0.59/0.65 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.59/0.65 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.59/0.65 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.59/0.65 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.59/0.65 c applied globally : - - - 4 1.5 - - -
0.59/0.65 c applied locally : - - - 0 0.0 - - -
0.59/0.65 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.59/0.65 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.59/0.65 c redcost : 0.00 0 0 0 0 0
0.59/0.65 c impliedbounds : 0.00 0 0 0 0 0
0.59/0.65 c intobj : 0.00 0 0 0 0 0
0.59/0.65 c cgmip : 0.00 0 0 0 0 0
0.59/0.65 c gomory : 0.00 0 0 0 0 0
0.59/0.65 c strongcg : 0.00 0 0 0 0 0
0.59/0.65 c cmir : 0.00 0 0 0 0 0
0.59/0.65 c flowcover : 0.00 0 0 0 0 0
0.59/0.65 c clique : 0.00 0 0 0 0 0
0.59/0.65 c zerohalf : 0.00 0 0 0 0 0
0.59/0.65 c mcf : 0.00 0 0 0 0 0
0.59/0.65 c rapidlearning : 0.00 0 0 0 0 0
0.59/0.65 c Pricers : Time Calls Vars
0.59/0.65 c problem variables: 0.00 0 0
0.59/0.65 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.59/0.65 c relpscost : 0.00 0 0 0 0 0 0
0.59/0.65 c pscost : 0.00 0 0 0 0 0 0
0.59/0.65 c inference : 0.00 30 0 0 0 0 60
0.59/0.65 c mostinf : 0.00 0 0 0 0 0 0
0.59/0.65 c leastinf : 0.00 0 0 0 0 0 0
0.59/0.65 c fullstrong : 0.00 0 0 0 0 0 0
0.59/0.65 c allfullstrong : 0.00 0 0 0 0 0 0
0.59/0.65 c random : 0.00 0 0 0 0 0 0
0.59/0.65 c Primal Heuristics : Time Calls Found
0.59/0.65 c LP solutions : 0.00 - 0
0.59/0.65 c pseudo solutions : 0.00 - 0
0.59/0.65 c oneopt : 0.00 0 0
0.59/0.65 c trivial : 0.01 2 0
0.59/0.65 c simplerounding : 0.00 0 0
0.59/0.65 c zirounding : 0.00 0 0
0.59/0.65 c rounding : 0.00 0 0
0.59/0.65 c shifting : 0.00 0 0
0.59/0.65 c intshifting : 0.00 0 0
0.59/0.65 c twoopt : 0.00 0 0
0.59/0.65 c fixandinfer : 0.00 0 0
0.59/0.65 c feaspump : 0.00 0 0
0.59/0.65 c coefdiving : 0.00 0 0
0.59/0.65 c pscostdiving : 0.00 0 0
0.59/0.65 c fracdiving : 0.00 0 0
0.59/0.65 c veclendiving : 0.00 0 0
0.59/0.65 c intdiving : 0.00 0 0
0.59/0.65 c actconsdiving : 0.00 0 0
0.59/0.65 c objpscostdiving : 0.00 0 0
0.59/0.65 c rootsoldiving : 0.00 0 0
0.59/0.65 c linesearchdiving : 0.00 0 0
0.59/0.65 c guideddiving : 0.00 0 0
0.59/0.65 c octane : 0.00 0 0
0.59/0.65 c rens : 0.00 0 0
0.59/0.65 c rins : 0.00 0 0
0.59/0.65 c localbranching : 0.00 0 0
0.59/0.65 c mutation : 0.00 0 0
0.59/0.65 c crossover : 0.00 0 0
0.59/0.65 c dins : 0.00 0 0
0.59/0.65 c undercover : 0.00 0 0
0.59/0.65 c nlp : 0.00 0 0
0.59/0.65 c trysol : 0.00 0 0
0.59/0.65 c LP : Time Calls Iterations Iter/call Iter/sec
0.59/0.65 c primal LP : 0.00 0 0 0.00 -
0.59/0.65 c dual LP : 0.00 0 0 0.00 -
0.59/0.65 c lex dual LP : 0.00 0 0 0.00 -
0.59/0.65 c barrier LP : 0.00 0 0 0.00 -
0.59/0.65 c diving/probing LP: 0.00 0 0 0.00 -
0.59/0.65 c strong branching : 0.00 0 0 0.00 -
0.59/0.65 c (at root node) : - 0 0 0.00 -
0.59/0.65 c conflict analysis: 0.00 0 0 0.00 -
0.59/0.65 c B&B Tree :
0.59/0.65 c number of runs : 1
0.59/0.65 c nodes : 33
0.59/0.65 c nodes (total) : 33
0.59/0.65 c nodes left : 0
0.59/0.65 c max depth : 29
0.59/0.65 c max depth (total): 29
0.59/0.65 c backtracks : 1 (3.0%)
0.59/0.65 c delayed cutoffs : 28
0.59/0.65 c repropagations : 31 (14 domain reductions, 2 cutoffs)
0.59/0.65 c avg switch length: 3.64
0.59/0.65 c switching time : 0.00
0.59/0.65 c Solution :
0.59/0.65 c Solutions found : 0 (0 improvements)
0.59/0.65 c Primal Bound : infeasible
0.59/0.65 c Dual Bound : -
0.59/0.65 c Gap : 0.00 %
0.59/0.65 c Root Dual Bound : +1.27300000000000e+03
0.59/0.65 c Root Iterations : 0
0.59/0.67 c Time complete: 0.66.