0.00/0.00 c SCIP version 10.0.0 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Soplex 7.0.0] [GitHash: 405ed0d46f]
0.00/0.00 c Copyright (c) 2002-2024 Zuse Institute 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-4451375-1721428811.opb>
0.00/0.00 c original problem has 99 variables (99 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.00/0.00 c problem read in 0.00
0.00/0.00 c No objective function, only one solution is needed.
0.00/0.00 c presolving:
0.00/0.00 c (round 1, fast) 1 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.00/0.00 c (0.0s) running MILP presolver
0.00/0.00 c (0.0s) MILP presolver found nothing
0.00/0.00 c (0.0s) probing: 51/98 (52.0%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.00 c (0.0s) probing aborted: 50/50 successive totally useless probings
0.00/0.00 c (0.0s) symmetry computation started: requiring (bin +, int +, cont +), (fixed: bin -, int -, cont -)
0.00/0.00 c (0.0s) no symmetry present (symcode time: 0.00)
0.00/0.00 c presolving (2 rounds: 2 fast, 1 medium, 1 exhaustive):
0.00/0.00 c 1 deleted vars, 1 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.00 c 0 implications, 0 cliques
0.00/0.00 c presolved problem has 98 variables (98 bin, 0 int, 0 impl, 0 cont) and 49 constraints
0.00/0.00 c 49 constraints of type <linear>
0.00/0.00 c transformed objective value is always integral (scale: 1)
0.00/0.00 c Presolving Time: 0.00
0.00/0.00 c - non default parameters ----------------------------------------------------------------------
0.00/0.00 c # SCIP version 10.0.0
0.00/0.00 c
0.00/0.00 c # maximal time in seconds to run
0.00/0.00 c # [type: real, advanced: FALSE, range: [0,1e+20], default: 1e+20]
0.00/0.00 c limits/time = 3596.997011
0.00/0.00 c
0.00/0.00 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.00 c # [type: real, advanced: FALSE, range: [0,8796093022207], default: 8796093022207]
0.00/0.00 c limits/memory = 27900
0.00/0.00 c
0.00/0.00 c # solving stops, if the given number of solutions were found; this limit is first checked in presolving (-1: no limit)
0.00/0.00 c # [type: int, advanced: FALSE, range: [-1,2147483647], default: -1]
0.00/0.00 c limits/solutions = 1
0.00/0.00 c
0.00/0.00 c # bitset describing used symmetry handling technique: (0: off; 1: constraint-based (orbitopes and/or symresacks); 2: orbital fixing; 3: orbitopes and orbital fixing; 4: Schreier Sims cuts; 5: Schreier Sims cuts and orbitopes; 6: Schreier Sims cuts and orbital fixing; 7: Schreier Sims cuts, orbitopes, and orbital fixing) See type_symmetry.h.
0.00/0.00 c # [type: int, advanced: FALSE, range: [0,7], default: 7]
0.00/0.00 c misc/usesymmetry = 3
0.00/0.00 c
0.00/0.00 c # belongs reading time to solving time?
0.00/0.00 c # [type: bool, advanced: FALSE, range: {TRUE,FALSE}, default: FALSE]
0.00/0.00 c timing/reading = TRUE
0.00/0.00 c
0.00/0.00 c # Should we check whether the components of the symmetry group can be handled by double lex matrices?
0.00/0.00 c # [type: bool, advanced: TRUE, range: {TRUE,FALSE}, default: TRUE]
0.00/0.00 c propagating/symmetry/detectdoublelex = FALSE
0.00/0.00 c
0.00/0.00 c # Should we try to detect symmetric subgroups of the symmetry group on binary variables?
0.00/0.00 c # [type: bool, advanced: TRUE, range: {TRUE,FALSE}, default: TRUE]
0.00/0.00 c propagating/symmetry/detectsubgroups = FALSE
0.00/0.00 c
0.00/0.00 c # Type of symmetries that shall be computed?
0.00/0.00 c # [type: int, advanced: TRUE, range: [0,1], default: 0]
0.00/0.00 c propagating/symmetry/symtype = 1
0.00/0.00 c
0.00/0.00 c # Should components consisting of a single full reflection be handled?
0.00/0.00 c # [type: bool, advanced: TRUE, range: {TRUE,FALSE}, default: TRUE]
0.00/0.00 c propagating/symmetry/usesimplesgncomp = FALSE
0.00/0.00 c
0.00/0.00 c -----------------------------------------------------------------------------------------------
0.00/0.00 c start solving
0.00/0.00 c
0.00/0.02 c time | node | left |LP iter|LP it/n|mem/heur|mdpt |vars |cons |rows |cuts |sepa|confs|strbr| dualbound | primalbound | gap | compl.
0.00/0.02 c 0.0s| 1 | 0 | 73 | - | 1850k | 0 | 98 | 63 | 49 | 0 | 0 | 14 | 0 | 0.000000e+00 | -- | Inf | unknown
0.00/0.05 c 0.0s| 1 | 0 | 105 | - | 2132k | 0 | 98 | 263 | 55 | 6 | 1 | 14 | 0 | 0.000000e+00 | -- | Inf | unknown
0.00/0.05 c 0.0s| 1 | 0 | 108 | - | 2362k | 0 | 98 | 263 | 57 | 8 | 2 | 14 | 0 | 0.000000e+00 | -- | Inf | unknown
0.00/0.05 c 0.0s| 1 | 0 | 114 | - | 2398k | 0 | 98 | 263 | 59 | 10 | 3 | 14 | 0 | 0.000000e+00 | -- | Inf | unknown
0.00/0.05 c 0.0s| 1 | 0 | 120 | - | 2404k | 0 | 98 | 263 | 61 | 12 | 4 | 14 | 0 | 0.000000e+00 | -- | Inf | unknown
0.00/0.05 c 0.0s| 1 | 0 | 121 | - | 2488k | 0 | 98 | 263 | 65 | 16 | 5 | 14 | 0 | cutoff | -- | 0.00%| unknown
0.00/0.05 c 0.0s| 1 | 0 | 121 | - | 2488k | 0 | 98 | 263 | 65 | 16 | 5 | 14 | 0 | cutoff | -- | 0.00%| unknown
0.00/0.05 c
0.00/0.05 c SCIP Status : problem is solved [infeasible]
0.00/0.05 c Solving Time (sec) : 0.05
0.00/0.05 c Solving Nodes : 1
0.00/0.05 c Primal Bound : +1.00000000000000e+20 (0 solutions)
0.00/0.05 c Dual Bound : +1.00000000000000e+20
0.00/0.05 c Gap : 0.00 %
0.00/0.05 s UNSATISFIABLE
0.00/0.05 c SCIP Status : problem is solved [infeasible]
0.00/0.05 c Total Time : 0.05
0.00/0.05 c solving : 0.05
0.00/0.05 c presolving : 0.00 (included in solving)
0.00/0.05 c reading : 0.00 (included in solving)
0.00/0.05 c copying : 0.00 (1 #copies) (minimal 0.00, maximal 0.00, average 0.00)
0.00/0.05 c Original Problem :
0.00/0.05 c Problem name : HOME/instance-4451375-1721428811.opb
0.00/0.05 c Variables : 99 (99 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.05 c Constraints : 50 initial, 50 maximal
0.00/0.05 c Objective : minimize, 0 non-zeros (abs.min = 1e+20, abs.max = -1e+20)
0.00/0.05 c Presolved Problem :
0.00/0.05 c Problem name : t_HOME/instance-4451375-1721428811.opb
0.00/0.05 c Variables : 98 (98 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.05 c Constraints : 49 initial, 263 maximal
0.00/0.05 c Objective : minimize, 0 non-zeros (abs.min = 1e+20, abs.max = -1e+20)
0.00/0.05 c Nonzeros : 196 constraint, 0 clique table
0.00/0.05 c Presolvers : ExecTime SetupTime Calls FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.05 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c domcol : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.05 c dualagg : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c dualcomp : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c dualinfer : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c dualsparsify : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.05 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c implics : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.05 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c milp : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.05 c qpkktref : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c redvub : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c sparsify : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.05 c stuffing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c trivial : 0.00 0.00 2 0 0 0 0 0 0 0 0 0
0.00/0.05 c tworowbnd : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c dualfix : 0.00 0.00 2 0 0 0 0 0 0 0 0 0
0.00/0.05 c genvbounds : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c probing : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.05 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c symmetry : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.05 c vbounds : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c linear : 0.00 0.00 3 0 1 0 0 0 1 0 0 0
0.00/0.05 c logicor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c benders : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c components : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.05 c root node : - - - 0 - - 0 - - - - -
0.00/0.05 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoRelax #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Applied Conss Children
0.00/0.05 c benderslp : 0 0 0 0 0 0 0 12 0 0 0 0 0 0 0
0.00/0.05 c integral : 0 0 0 0 0 0 0 12 0 0 0 0 0 0 0
0.00/0.05 c linear : 49+ 249 6 267 0 0 0 11 76 9 0 0 0 0 0
0.00/0.05 c logicor : 0+ 14 5 18 0 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c benders : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c fixedvar : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c components : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS EnfoRelax Check ResProp SB-Prop
0.00/0.05 c benderslp : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c benders : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c fixedvar : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c components : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.00/0.05 c dualfix : 1 0 0 0
0.00/0.05 c genvbounds : 0 0 0 0
0.00/0.05 c nlobbt : 0 0 0 0
0.00/0.05 c obbt : 0 0 0 0
0.00/0.05 c probing : 0 0 0 0
0.00/0.05 c pseudoobj : 0 0 0 0
0.00/0.05 c redcost : 0 0 0 0
0.00/0.05 c rootredcost : 0 0 0 0
0.00/0.05 c symmetry : 0 0 0 0
0.00/0.05 c vbounds : 0 0 0 0
0.00/0.05 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp SB-Prop
0.00/0.05 c dualfix : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c genvbounds : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c nlobbt : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c obbt : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c probing : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c pseudoobj : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c redcost : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c rootredcost : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c symmetry : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c vbounds : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c Symmetry :
0.00/0.05 c orbitopal red. : 0 reductions applied, 0 cutoffs
0.00/0.05 c orbital reduction: 0 reductions applied, 0 cutoffs
0.00/0.05 c lexicographic red: 0 reductions applied, 0 cutoffs
0.00/0.05 c shadow tree time : 0.00 s
0.00/0.05 c Conflict Analysis : Time Calls Success DomReds Conflicts Literals Reconvs ReconvLits Dualrays Nonzeros LP Iters (pool size: [10000,10000])
0.00/0.05 c propagation : 0.00 5 5 - 10 6.2 4 6.5 - - -
0.00/0.05 c infeasible LP : 0.00 0 0 - 0 0.0 0 0.0 0 0.0 0
0.00/0.05 c bound exceed. LP : 0.00 0 0 - 0 0.0 0 0.0 0 0.0 0
0.00/0.05 c strong branching : 0.00 0 0 - 0 0.0 0 0.0 - - 0
0.00/0.05 c pseudo solution : 0.00 0 0 - 0 0.0 0 0.0 - - -
0.00/0.05 c applied globally : 0.00 - - 0 14 6.3 - - 0 - -
0.00/0.05 c applied locally : - - - 0 0 0.0 - - 0 - -
0.00/0.05 c Separators : ExecTime SetupTime Calls RootCalls Cutoffs DomReds FoundCuts ViaPoolAdd DirectAdd Applied ViaPoolApp DirectApp Conss
0.00/0.05 c cut pool : 0.00 - 9 9 - - 52 52 - - - - - (maximal pool size: 52)
0.00/0.05 c aggregation : 0.00 0.00 5 5 0 0 0 0 0 0 0 0 0
0.00/0.05 c > cmir : - - - - - - - 0 0 0 0 0 -
0.00/0.05 c > flowcover : - - - - - - - 0 0 0 0 0 -
0.00/0.05 c > knapsackcover : - - - - - - - 0 0 0 0 0 -
0.00/0.05 c cgmip : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c clique : 0.00 0.00 1 1 0 0 0 0 0 0 0 0 0
0.00/0.05 c closecuts : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c convexproj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c disjunctive : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c eccuts : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c gauge : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c gomory : 0.00 0.00 5 5 0 0 45 45 0 10 10 0 0
0.00/0.05 c > gomorymi : - - - - - - - 0 0 0 0 0 -
0.00/0.05 c > strongcg : - - - - - - - 45 0 10 10 0 -
0.00/0.05 c impliedbounds : 0.00 0.00 5 5 0 0 0 0 0 0 0 0 0
0.00/0.05 c interminor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c intobj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c lagromory : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c mcf : 0.00 0.00 1 1 0 0 0 0 0 0 0 0 0
0.00/0.05 c minor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c mixing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c multilinear : 0.00 0.00 5 5 0 0 0 0 0 0 0 0 0
0.00/0.05 c oddcycle : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.05 c rapidlearning : 0.02 0.00 1 1 0 0 0 0 0 0 0 0 200
0.00/0.05 c rlt : 0.00 0.00 5 5 0 0 0 0 0 0 0 0 0
0.00/0.05 c zerohalf : 0.00 0.00 5 5 0 0 7 7 0 6 6 0 0
0.00/0.05 c Cutselectors : ExecTime SetupTime Calls RootCalls Selected Forced Filtered RootSelec RootForc RootFilt
0.00/0.05 c hybrid : 0.00 0.00 5 5 16 0 36 16 0 36
0.00/0.05 c ensemble : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c dynamic : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c Pricers : ExecTime SetupTime Calls Vars
0.00/0.05 c problem variables: 0.00 - 0 0
0.00/0.05 c Branching Rules : ExecTime SetupTime BranchLP BranchExt BranchPS Cutoffs DomReds Cuts Conss Children
0.00/0.05 c allfullstrong : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c cloud : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c distribution : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c fullstrong : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c gomory : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c inference : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c leastinf : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c lookahead : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c mostinf : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c multaggr : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c nodereopt : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c pscost : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c random : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c relpscost : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c vanillafullstrong: 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.05 c Primal Heuristics : ExecTime SetupTime Calls Found Best
0.00/0.05 c LP solutions : 0.00 - - 0 0
0.00/0.05 c relax solutions : 0.00 - - 0 0
0.00/0.05 c pseudo solutions : 0.00 - - 0 0
0.00/0.05 c strong branching : 0.00 - - 0 0
0.00/0.05 c actconsdiving : 0.00 0.00 0 0 0
0.00/0.05 c adaptivediving : 0.00 0.00 0 0 0
0.00/0.05 c alns : 0.00 0.00 0 0 0
0.00/0.05 c bound : 0.00 0.00 0 0 0
0.00/0.05 c clique : 0.00 0.00 0 0 0
0.00/0.05 c coefdiving : 0.00 0.00 0 0 0
0.00/0.05 c completesol : 0.00 0.00 0 0 0
0.00/0.05 c conflictdiving : 0.00 0.00 0 0 0
0.00/0.05 c crossover : 0.00 0.00 0 0 0
0.00/0.05 c dins : 0.00 0.00 0 0 0
0.00/0.05 c distributiondivin: 0.00 0.00 0 0 0
0.00/0.05 c dps : 0.00 0.00 0 0 0
0.00/0.05 c dualval : 0.00 0.00 0 0 0
0.00/0.05 c farkasdiving : 0.00 0.00 0 0 0
0.00/0.05 c feasjump : 0.02 0.00 1 0 0
0.00/0.05 c feaspump : 0.00 0.00 1 0 0
0.00/0.05 c fixandinfer : 0.00 0.00 0 0 0
0.00/0.05 c fracdiving : 0.00 0.00 0 0 0
0.00/0.05 c gins : 0.00 0.00 0 0 0
0.00/0.05 c guideddiving : 0.00 0.00 0 0 0
0.00/0.05 c indcoefdiving : 0.00 0.00 0 0 0
0.00/0.05 c indicator : 0.00 0.00 0 0 0
0.00/0.05 c indicatordiving : 0.00 0.00 0 0 0
0.00/0.05 c indoneopt : 0.00 0.00 0 0 0
0.00/0.05 c indrounding : 0.00 0.00 0 0 0
0.00/0.05 c indtwoopt : 0.00 0.00 0 0 0
0.00/0.05 c intdiving : 0.00 0.00 0 0 0
0.00/0.05 c intshifting : 0.00 0.00 0 0 0
0.00/0.05 c linesearchdiving : 0.00 0.00 0 0 0
0.00/0.05 c localbranching : 0.00 0.00 0 0 0
0.00/0.05 c locks : 0.00 0.00 1 0 0
0.00/0.05 c lpface : 0.00 0.00 0 0 0
0.00/0.05 c mpec : 0.00 0.00 0 0 0
0.00/0.05 c multistart : 0.00 0.00 0 0 0
0.00/0.05 c mutation : 0.00 0.00 0 0 0
0.00/0.05 c nlpdiving : 0.00 0.00 0 0 0
0.00/0.05 c objpscostdiving : 0.00 0.00 0 0 0
0.00/0.05 c octane : 0.00 0.00 0 0 0
0.00/0.05 c ofins : 0.00 0.00 0 0 0
0.00/0.05 c oneopt : 0.00 0.00 0 0 0
0.00/0.05 c padm : 0.00 0.00 0 0 0
0.00/0.05 c proximity : 0.00 0.00 0 0 0
0.00/0.05 c pscostdiving : 0.00 0.00 0 0 0
0.00/0.05 c randrounding : 0.00 0.00 5 0 0
0.00/0.05 c rens : 0.00 0.00 0 0 0
0.00/0.05 c reoptsols : 0.00 0.00 0 0 0
0.00/0.05 c repair : 0.00 0.00 0 0 0
0.00/0.05 c rins : 0.00 0.00 0 0 0
0.00/0.05 c rootsoldiving : 0.00 0.00 0 0 0
0.00/0.05 c rounding : 0.00 0.00 5 0 0
0.00/0.05 c scheduler : 0.00 0.00 0 0 0
0.00/0.05 c shiftandpropagate: 0.00 0.00 1 0 0
0.00/0.05 c shifting : 0.00 0.00 5 0 0
0.00/0.05 c simplerounding : 0.00 0.00 0 0 0
0.00/0.05 c smallcard : 0.00 0.00 0 0 0
0.00/0.05 c subnlp : 0.00 0.00 0 0 0
0.00/0.05 c trivial : 0.00 0.00 2 0 0
0.00/0.05 c trivialnegation : 0.00 0.00 0 0 0
0.00/0.05 c trustregion : 0.00 0.00 0 0 0
0.00/0.05 c trysol : 0.00 0.00 0 0 0
0.00/0.05 c twoopt : 0.00 0.00 0 0 0
0.00/0.05 c undercover : 0.00 0.00 0 0 0
0.00/0.05 c vbounds : 0.00 0.00 0 0 0
0.00/0.05 c veclendiving : 0.00 0.00 0 0 0
0.00/0.05 c zeroobj : 0.00 0.00 0 0 0
0.00/0.05 c zirounding : 0.00 0.00 0 0 0
0.00/0.05 c other solutions : - - - 0 -
0.00/0.05 c LNS (Scheduler) : Calls SetupTime SolveTime SolveNodes Sols Best Exp3 Exp3-IX EpsGreedy UCB TgtFixRate Opt Inf Node Stal Sol Usr Othr Actv
0.00/0.05 c rens : 0 0.00 0.00 0 0 0 0.00000 0.14286 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
0.00/0.05 c rins : 0 0.00 0.00 0 0 0 0.00000 0.14286 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
0.00/0.05 c mutation : 0 0.00 0.00 0 0 0 0.00000 0.14286 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
0.00/0.05 c localbranching : 0 0.00 0.00 0 0 0 0.00000 0.14286 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
0.00/0.05 c crossover : 0 0.00 0.00 0 0 0 0.00000 0.14286 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
0.00/0.05 c proximity : 0 0.00 0.00 0 0 0 0.00000 0.14286 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
0.00/0.05 c dins : 0 0.00 0.00 0 0 0 0.00000 0.14286 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 1
0.00/0.05 c zeroobjective : 0 0.00 0.00 0 0 0 0.00000 0.00000 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 0
0.00/0.05 c trustregion : 0 0.00 0.00 0 0 0 0.00000 0.00000 -1.00000 1.00000 0.900 0 0 0 0 0 0 0 0
0.00/0.05 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It ItLimit
0.00/0.05 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.05 c dual LP : 0.00 6 101 16.83 - 0.00 0
0.00/0.05 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.05 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.05 c resolve instable : 0.00 0 0 0.00 -
0.00/0.05 c diving/probing LP: 0.00 9 20 2.22 -
0.00/0.05 c strong branching : 0.00 0 0 0.00 - - - 0
0.00/0.05 c (at root node) : - 0 0 0.00 -
0.00/0.05 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.05 c B&B Tree :
0.00/0.05 c number of runs : 1
0.00/0.05 c nodes : 1 (0 internal, 1 leaves)
0.00/0.05 c feasible leaves : 0
0.00/0.05 c infeas. leaves : 1
0.00/0.05 c objective leaves : 0
0.00/0.05 c nodes (total) : 1 (0 internal, 1 leaves)
0.00/0.05 c nodes left : 0
0.00/0.05 c max depth : 0
0.00/0.05 c max depth (total): 0
0.00/0.05 c backtracks : 0 (0.0%)
0.00/0.05 c early backtracks : 0 (0.0%)
0.00/0.05 c nodes exc. ref. : 0 (0.0%)
0.00/0.05 c delayed cutoffs : 0
0.00/0.05 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.05 c avg switch length: 2.00
0.00/0.05 c switching time : 0.00
0.00/0.05 c Root Node :
0.00/0.05 c First LP value : +0.00000000000000e+00
0.00/0.05 c First LP Iters : 73 (245791.25 Iter/sec)
0.00/0.05 c First LP Time : 0.00
0.00/0.05 c Final Dual Bound : -
0.00/0.05 c Final Root Iters : 121
0.00/0.05 c Root LP Estimate : -
0.00/0.05 c Solution :
0.00/0.05 c Solutions found : 0 (0 improvements)
0.00/0.05 c Primal Bound : infeasible
0.00/0.05 c Dual Bound : -
0.00/0.05 c Gap : 0.00 %
0.00/0.05 c Integrals : Total Avg%
0.00/0.05 c primal-dual : - - (problem infeasible)
0.00/0.05 c primal-ref : - - (problem infeasible)
0.00/0.05 c dual-ref : - - (problem infeasible)
0.00/0.05 c Time complete: 0.053537.
runsolver version 3.4.2 (svn: 4680) Copyright (C) 2010-2013 Olivier ROUSSEL
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
NUMA information:
number of nodes: 2
memory of node 0: 63931 MiB (61412 MiB free)
memory of node 1: 64510 MiB (62304 MiB free)
node distances:
10 21
21 10
command line: BIN/runsolver --timestamp --file-size-limit 102400 -w /tmp/evaluation-result-4451375-1721428811/watcher-4451375-1721428811 -o /tmp/evaluation-result-4451375-1721428811/solver-4451375-1721428811 -C 3600 -W 3700 -M 31000 --bin-var /tmp/runsolver-exch-nodeC017-1721421618-1052160 --watchdog 3760 pbscip -f HOME/instance-4451375-1721428811.opb -t 3600 -j 2 -m 31000
running on 2 cores: 4,6
CPU governors:
performance: 4 6
Enforcing FSIZE limit: 104857600 KiB
Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 3600 seconds
Enforcing CPUTime limit (hard limit, will send SIGXCPU): 3630 seconds
Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 3700 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 31744000 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 31795200 KiB
Linux 4.18.0-301.1.el8.x86_64
Starting watchdog thread
solver pid=1057147, runsolver pid=1057144
Current StackSize limit: 8192 KiB
[startup+0.0576689 s]
# the end of solver process 1057147 was just reported to runsolver
# Child status: 0
# cumulated CPU time of all completed processes: user=0.051555 s, system=0.004963 s
Solver just ended.
??? end of watcher thread
Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.057708
CPU time (s): 0.056518
CPU user time (s): 0.051555
CPU system time (s): 0.004963
CPU usage (%): 97.9379
Max. virtual memory (cumulated for all children) (KiB): 0
Max. memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.051555
system time used= 0.004963
maximum resident set size= 21944
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 1743
page faults= 0
swaps= 0
block input operations= 0
block output operations= 0
messages sent= 0
messages received= 0
signals received= 0
voluntary context switches= 7
involuntary context switches= 4
# summary of solver processes directly reported to runsolver:
# pid: 1057147
# total CPU time (s): 0.056518
# total CPU user time (s): 0.051555
# total CPU system time (s): 0.004963
??? join timestamper begins
??? join timestamper ends
??? end of timestamper thread
runsolver used 0.005129 second user time and 0.009277 second system time
The end