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-2664633-1276418918.opb>
0.02/0.03 c original problem has 870 variables (870 bin, 0 int, 0 impl, 0 cont) and 1462 constraints
0.02/0.03 c problem read
0.02/0.03 c presolving settings loaded
0.02/0.03 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.02/0.04 c presolving:
0.02/0.07 c (round 1) 631 del vars, 126 del conss, 8 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 15762 impls, 0 clqs
0.02/0.08 c (round 2) 738 del vars, 1044 del conss, 35 chg bounds, 2 chg sides, 2 chg coeffs, 0 upgd conss, 16580 impls, 0 clqs
0.02/0.08 c (round 3) 752 del vars, 1185 del conss, 40 chg bounds, 2 chg sides, 2 chg coeffs, 0 upgd conss, 16618 impls, 0 clqs
0.02/0.09 c (round 4) 761 del vars, 1207 del conss, 44 chg bounds, 2 chg sides, 2 chg coeffs, 0 upgd conss, 16813 impls, 0 clqs
0.02/0.09 c (round 5) 765 del vars, 1218 del conss, 45 chg bounds, 2 chg sides, 2 chg coeffs, 0 upgd conss, 16813 impls, 0 clqs
0.02/0.09 c (round 6) 765 del vars, 1223 del conss, 45 chg bounds, 2 chg sides, 2 chg coeffs, 0 upgd conss, 16813 impls, 0 clqs
0.09/0.10 c (round 7) 765 del vars, 1229 del conss, 45 chg bounds, 2 chg sides, 2 chg coeffs, 231 upgd conss, 16813 impls, 0 clqs
0.09/0.10 c (round 8) 765 del vars, 1229 del conss, 45 chg bounds, 2 chg sides, 2 chg coeffs, 233 upgd conss, 16813 impls, 0 clqs
0.09/0.11 c (round 9) 799 del vars, 1229 del conss, 45 chg bounds, 2 chg sides, 2 chg coeffs, 233 upgd conss, 17047 impls, 0 clqs
0.09/0.11 c (round 10) 801 del vars, 1272 del conss, 45 chg bounds, 2 chg sides, 2 chg coeffs, 233 upgd conss, 17067 impls, 0 clqs
0.09/0.12 c (round 11) 801 del vars, 1280 del conss, 45 chg bounds, 2 chg sides, 2 chg coeffs, 233 upgd conss, 17067 impls, 0 clqs
0.09/0.12 c presolving (12 rounds):
0.09/0.12 c 801 deleted vars, 1280 deleted constraints, 45 tightened bounds, 0 added holes, 2 changed sides, 2 changed coefficients
0.09/0.12 c 17067 implications, 0 cliques
0.09/0.12 c presolved problem has 69 variables (69 bin, 0 int, 0 impl, 0 cont) and 182 constraints
0.09/0.12 c 182 constraints of type <logicor>
0.09/0.12 c transformed objective value is always integral (scale: 1)
0.09/0.12 c Presolving Time: 0.06
0.09/0.12 c - non default parameters ----------------------------------------------------------------------
0.09/0.12 c # SCIP version 1.2.1.2
0.09/0.12 c
0.09/0.12 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c conflict/interconss = 0
0.09/0.12 c
0.09/0.12 c # should binary conflicts be preferred?
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c conflict/preferbinary = TRUE
0.09/0.12 c
0.09/0.12 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c constraints/agelimit = 1
0.09/0.12 c
0.09/0.12 c # should enforcement of pseudo solution be disabled?
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/disableenfops = TRUE
0.09/0.12 c
0.09/0.12 c # frequency for displaying node information lines
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.12 c display/freq = 10000
0.09/0.12 c
0.09/0.12 c # maximal time in seconds to run
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/time = 1799.98
0.09/0.12 c
0.09/0.12 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/memory = 1620
0.09/0.12 c
0.09/0.12 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c lp/solvefreq = -1
0.09/0.12 c
0.09/0.12 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.09/0.12 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.12 c lp/pricing = a
0.09/0.12 c
0.09/0.12 c # should presolving try to simplify inequalities
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/linear/simplifyinequalities = TRUE
0.09/0.12 c
0.09/0.12 c # should presolving try to simplify knapsacks
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.12 c
0.09/0.12 c # priority of node selection rule <dfs> in standard mode
0.09/0.12 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.12 c nodeselection/dfs/stdpriority = 1000000
0.09/0.12 c
0.09/0.12 c -----------------------------------------------------------------------------------------------
0.09/0.12 c start solving
0.09/0.12 c
0.09/0.12 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.12 c 0.1s| 1 | 2 | 0 | - |2196k| 0 | - | 69 | 182 | 0 | 0 | 0 | 0 | 0 | 4.270000e+02 | -- | Inf
0.09/0.13 c
0.09/0.13 c SCIP Status : problem is solved [infeasible]
0.09/0.13 c Solving Time (sec) : 0.08
0.09/0.13 c Solving Nodes : 58
0.09/0.13 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.09/0.13 c Dual Bound : +1.00000000000000e+20
0.09/0.13 c Gap : 0.00 %
0.09/0.13 s UNSATISFIABLE
0.09/0.13 c SCIP Status : problem is solved [infeasible]
0.09/0.13 c Solving Time : 0.08
0.09/0.13 c Original Problem :
0.09/0.13 c Problem name : HOME/instance-2664633-1276418918.opb
0.09/0.13 c Variables : 870 (870 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.13 c Constraints : 1462 initial, 1462 maximal
0.09/0.13 c Presolved Problem :
0.09/0.13 c Problem name : t_HOME/instance-2664633-1276418918.opb
0.09/0.13 c Variables : 69 (69 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.13 c Constraints : 182 initial, 190 maximal
0.09/0.13 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.09/0.13 c trivial : 0.00 22 0 0 0 0 0 0 0
0.09/0.13 c dualfix : 0.00 17 0 0 0 0 0 0 0
0.09/0.13 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.09/0.13 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.09/0.13 c implics : 0.01 0 595 0 0 0 0 0 0
0.09/0.13 c probing : 0.01 16 18 0 0 0 0 0 0
0.09/0.13 c linear : 0.03 45 88 0 45 0 1229 2 2
0.09/0.13 c logicor : 0.01 0 0 0 0 0 51 0 0
0.09/0.13 c root node : - 22 - - 22 - - - -
0.09/0.13 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.09/0.13 c integral : 0 0 0 0 0 0 0 0 0 0
0.09/0.13 c logicor : 182+ 0 482 0 0 39 366 0 0 0
0.09/0.13 c countsols : 0 0 0 0 0 0 0 0 0 0
0.09/0.13 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.09/0.13 c integral : 0.00 0.00 0.00 0.00 0.00
0.09/0.13 c logicor : 0.00 0.00 0.00 0.00 0.00
0.09/0.13 c countsols : 0.00 0.00 0.00 0.00 0.00
0.09/0.13 c Propagators : Time Calls Cutoffs DomReds
0.09/0.13 c vbounds : 0.00 2 0 0
0.09/0.13 c rootredcost : 0.00 0 0 0
0.09/0.13 c pseudoobj : 0.00 228 0 0
0.09/0.13 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.09/0.13 c propagation : 0.00 30 28 28 2.4 0 0.0 -
0.09/0.13 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.13 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.13 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.13 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.13 c applied globally : - - - 28 2.4 - - -
0.09/0.13 c applied locally : - - - 0 0.0 - - -
0.09/0.13 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.09/0.13 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.09/0.13 c redcost : 0.00 0 0 0 0 0
0.09/0.13 c impliedbounds : 0.00 0 0 0 0 0
0.09/0.13 c intobj : 0.00 0 0 0 0 0
0.09/0.13 c cgmip : 0.00 0 0 0 0 0
0.09/0.13 c gomory : 0.00 0 0 0 0 0
0.09/0.13 c strongcg : 0.00 0 0 0 0 0
0.09/0.13 c cmir : 0.00 0 0 0 0 0
0.09/0.13 c flowcover : 0.00 0 0 0 0 0
0.09/0.13 c clique : 0.00 0 0 0 0 0
0.09/0.13 c zerohalf : 0.00 0 0 0 0 0
0.09/0.13 c mcf : 0.00 0 0 0 0 0
0.09/0.13 c rapidlearning : 0.00 0 0 0 0 0
0.09/0.13 c Pricers : Time Calls Vars
0.09/0.13 c problem variables: 0.00 0 0
0.09/0.13 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.09/0.13 c relpscost : 0.00 0 0 0 0 0 0
0.09/0.13 c pscost : 0.00 0 0 0 0 0 0
0.09/0.13 c inference : 0.00 42 0 0 0 0 84
0.09/0.13 c mostinf : 0.00 0 0 0 0 0 0
0.09/0.13 c leastinf : 0.00 0 0 0 0 0 0
0.09/0.13 c fullstrong : 0.00 0 0 0 0 0 0
0.09/0.13 c allfullstrong : 0.00 0 0 0 0 0 0
0.09/0.13 c random : 0.00 0 0 0 0 0 0
0.09/0.13 c Primal Heuristics : Time Calls Found
0.09/0.13 c LP solutions : 0.00 - 0
0.09/0.13 c pseudo solutions : 0.00 - 0
0.09/0.13 c oneopt : 0.00 0 0
0.09/0.13 c trivial : 0.00 2 0
0.09/0.13 c simplerounding : 0.00 0 0
0.09/0.13 c zirounding : 0.00 0 0
0.09/0.13 c rounding : 0.00 0 0
0.09/0.13 c shifting : 0.00 0 0
0.09/0.13 c intshifting : 0.00 0 0
0.09/0.13 c twoopt : 0.00 0 0
0.09/0.13 c fixandinfer : 0.00 0 0
0.09/0.13 c feaspump : 0.00 0 0
0.09/0.13 c coefdiving : 0.00 0 0
0.09/0.13 c pscostdiving : 0.00 0 0
0.09/0.13 c fracdiving : 0.00 0 0
0.09/0.13 c veclendiving : 0.00 0 0
0.09/0.13 c intdiving : 0.00 0 0
0.09/0.13 c actconsdiving : 0.00 0 0
0.09/0.13 c objpscostdiving : 0.00 0 0
0.09/0.13 c rootsoldiving : 0.00 0 0
0.09/0.13 c linesearchdiving : 0.00 0 0
0.09/0.13 c guideddiving : 0.00 0 0
0.09/0.13 c octane : 0.00 0 0
0.09/0.13 c rens : 0.00 0 0
0.09/0.13 c rins : 0.00 0 0
0.09/0.13 c localbranching : 0.00 0 0
0.09/0.13 c mutation : 0.00 0 0
0.09/0.13 c crossover : 0.00 0 0
0.09/0.13 c dins : 0.00 0 0
0.09/0.13 c undercover : 0.00 0 0
0.09/0.13 c nlp : 0.00 0 0
0.09/0.13 c trysol : 0.00 0 0
0.09/0.13 c LP : Time Calls Iterations Iter/call Iter/sec
0.09/0.13 c primal LP : 0.00 0 0 0.00 -
0.09/0.13 c dual LP : 0.00 0 0 0.00 -
0.09/0.13 c lex dual LP : 0.00 0 0 0.00 -
0.09/0.13 c barrier LP : 0.00 0 0 0.00 -
0.09/0.13 c diving/probing LP: 0.00 0 0 0.00 -
0.09/0.13 c strong branching : 0.00 0 0 0.00 -
0.09/0.13 c (at root node) : - 0 0 0.00 -
0.09/0.13 c conflict analysis: 0.00 0 0 0.00 -
0.09/0.13 c B&B Tree :
0.09/0.13 c number of runs : 1
0.09/0.13 c nodes : 58
0.09/0.13 c nodes (total) : 58
0.09/0.13 c nodes left : 0
0.09/0.13 c max depth : 22
0.09/0.13 c max depth (total): 22
0.09/0.13 c backtracks : 14 (24.1%)
0.09/0.13 c delayed cutoffs : 27
0.09/0.13 c repropagations : 57 (206 domain reductions, 14 cutoffs)
0.09/0.13 c avg switch length: 3.00
0.09/0.13 c switching time : 0.00
0.09/0.13 c Solution :
0.09/0.13 c Solutions found : 0 (0 improvements)
0.09/0.13 c Primal Bound : infeasible
0.09/0.13 c Dual Bound : -
0.09/0.13 c Gap : 0.00 %
0.09/0.13 c Root Dual Bound : +4.27000000000000e+02
0.09/0.13 c Root Iterations : 0
0.09/0.14 c Time complete: 0.13.