0.00/0.00 c SCIP version 10.0.0 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 8.0.0] [GitHash: 0408ae5eca]
0.00/0.00 c Copyright (c) 2002-2025 Zuse Institute Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c External libraries:
0.00/0.00 c SoPlex 8.0.0 Linear programming solver developed at Zuse Institute Berlin (soplex.zib.de) [GitHash: 67f6a391]
0.00/0.00 c CppAD 20180000.0 Algorithmic Differentiation of C++ algorithms developed by B. Bell (github.com/coin-or/CppAD)
0.00/0.00 c AMPL/MP 4.0.0 AMPL .nl file reader library (github.com/ampl/mp)
0.00/0.00 c PaPILO 3.0.0 parallel presolve for integer and linear optimization (github.com/scipopt/papilo)
0.00/0.00 c bliss 0.77 Computing Graph Automorphisms by T. Junttila and P. Kaski (users.aalto.fi/~tjunttil/bliss)
0.00/0.00 c sassy 2.0 Symmetry preprocessor by Markus Anders (github.com/markusa4/sassy)
0.00/0.00 c
0.00/0.00 c reading problem <HOME/instance-4517961-1751533889.opb>
0.00/0.00 c original problem has 100 variables (100 bin, 0 int, 0 cont) and 1 constraints
0.00/0.00 c problem read in 0.000 seconds
0.00/0.00 o 0
0.00/0.00 c feasible solution found by trivial heuristic after 0.0 seconds, objective value 0.000000e+00
0.00/0.00 c presolving:
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 (round 1, exhaustive) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 0 impls, 4 clqs
0.00/0.00 c (round 2, fast) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 3 chg coeffs, 1 upgd conss, 0 impls, 4 clqs
0.00/0.00 c (round 3, medium) 0 del vars, 1 del conss, 0 add conss, 100 chg bounds, 0 chg sides, 3 chg coeffs, 1 upgd conss, 0 impls, 0 clqs
0.00/0.00 o -2197
0.00/0.00 c presolving (4 rounds: 4 fast, 3 medium, 2 exhaustive):
0.00/0.00 c 100 deleted vars, 1 deleted constraints, 0 added constraints, 100 tightened bounds, 0 added holes, 0 changed sides, 3 changed coefficients
0.00/0.00 c 0 implications, 0 cliques
0.00/0.00 c transformed 1/2 original solutions to the transformed problem space
0.00/0.00 c Presolving Time: 0.00
0.00/0.00 c
0.00/0.00 c SCIP Status : problem is solved [optimal solution found]
0.00/0.00 c Solving Time (sec) : 0.00
0.00/0.00 c Solving Nodes : 0
0.00/0.00 c Primal Bound : -2.19700000000000e+03 (2 solutions)
0.00/0.00 c Dual Bound : -2.19700000000000e+03
0.00/0.00 c Gap : 0.00 %
0.00/0.00 c problem pure SAT
0.00/0.00 c
0.00/0.00 c - non default parameters ----------------------------------------------------------------------
0.00/0.00 c
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.998345
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 # 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 # maximum allowed 'intsize' (i.e. the number of bits required to represent the sum of absolute values of all integers that appear in a constraint or objective function) or -1 for unlimited
0.00/0.00 c # [type: int, advanced: TRUE, range: [-1,2147483647], default: -1]
0.00/0.00 c reading/opbreader/maxintsize = 47
0.00/0.00 c
0.00/0.00 c # timing when propagator should be called (1:BEFORELP, 2:DURINGLPLOOP, 4:AFTERLPLOOP, 15:ALWAYS))
0.00/0.00 c # [type: int, advanced: TRUE, range: [0,15], default: 15]
0.00/0.00 c propagating/genvbounds/timingmask = 0
0.00/0.00 c
0.00/0.00 c -----------------------------------------------------------------------------------------------
0.00/0.00 s OPTIMUM FOUND
0.00/0.00 v -x1 x2 -x3 -x4 -x5 -x6 -x7 -x8 -x9 -x10 -x11 x12 x13 -x14 -x15 -x16 -x17 -x18 -x19 -x20 x21 -x22 -x23 -x24 x25 -x26 x27 -x28 -x29
0.00/0.00 v x30 -x31 -x32 -x33 -x34 -x35 -x36 -x37 -x38 -x39 -x40 -x41 -x42 -x43 -x44 -x45 -x46 x47 -x48 -x49 -x50 -x51 -x52 -x53 -x54 -x55
0.00/0.00 v -x56 -x57 -x58 -x59 -x60 -x61 -x62 -x63 x64 -x65 -x66 -x67 -x68 x69 -x70 x71 -x72 -x73 -x74 -x75 -x76 -x77 -x78 -x79 x80 -x81 -x82
0.00/0.00 v -x83 -x84 -x85 -x86 -x87 -x88 -x89 -x90 -x91 -x92 -x93 -x94 -x95 -x96 -x97 -x98 -x99 -x100
0.00/0.00 c SCIP Status : problem is solved [optimal solution found]
0.00/0.00 c Total Time : 0.00
0.00/0.00 c solving : 0.00
0.00/0.00 c presolving : 0.00 (included in solving)
0.00/0.00 c reading : 0.00 (included in solving)
0.00/0.00 c copying : 0.00 (0 times copied the problem)
0.00/0.00 c Original Problem :
0.00/0.00 c Problem name : HOME/instance-4517961-1751533889.opb
0.00/0.00 c Variables : 100 (100 binary, 0 integer, 0 continuous)
0.00/0.00 c implied integral : 0 (0 binary, 0 integer, 0 continuous)
0.00/0.00 c Constraints : 1 initial, 1 maximal
0.00/0.00 c Objective : minimize, 100 non-zeros (abs.min = 107, abs.max = 1097)
0.00/0.00 c Presolved Problem :
0.00/0.00 c Problem name : t_HOME/instance-4517961-1751533889.opb
0.00/0.00 c Variables : 0 (0 binary, 0 integer, 0 continuous)
0.00/0.00 c implied integral : 0 (0 binary, 0 integer, 0 continuous)
0.00/0.00 c Constraints : 0 initial, 0 maximal
0.00/0.00 c Objective : minimize, 0 non-zeros (abs.min = 1e+20, abs.max = -1e+20)
0.00/0.00 c Nonzeros : 0 constraint, 0 clique table
0.00/0.00 c Presolvers : ExecTime SetupTime Calls FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.00 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c domcol : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.00 c dualagg : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c dualcomp : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c dualinfer : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c dualsparsify : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.00 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c implics : 0.00 0.00 3 0 0 0 0 0 0 0 0 0
0.00/0.00 c implint : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c milp : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.00 c qpkktref : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c redvub : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c sparsify : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.00 c stuffing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c trivial : 0.00 0.00 4 100 0 0 0 0 0 0 0 0
0.00/0.00 c tworowbnd : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c dualfix : 0.00 0.00 4 0 0 0 0 0 0 0 0 0
0.00/0.00 c genvbounds : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c pseudoobj : 0.00 0.00 2 0 0 0 0 0 0 0 0 0
0.00/0.00 c symmetry : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.00 c vbounds : 0.00 0.00 1 0 0 0 0 0 0 0 0 0
0.00/0.00 c knapsack : 0.00 0.00 3 0 0 0 100 0 1 0 0 3
0.00/0.00 c linear : 0.00 0.00 2 0 0 0 0 0 0 0 0 0
0.00/0.00 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c root node : - - - 0 - - 0 - - - - -
0.00/0.00 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoRelax #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Applied Conss Children
0.00/0.00 c integral : 0 0 0 0 0 0 0 6 0 0 0 0 0 0 0
0.00/0.00 c fixedvar : 0 0 0 0 0 0 0 5 0 0 0 0 0 0 0
0.00/0.00 c countsols : 0 0 0 0 0 0 0 5 0 0 0 0 0 0 0
0.00/0.00 c components : 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS EnfoRelax Check ResProp SB-Prop
0.00/0.00 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.00 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.00 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.00 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.00 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.00/0.00 c dualfix : 0 0 0 0
0.00/0.00 c genvbounds : 0 0 0 0
0.00/0.00 c nlobbt : 0 0 0 0
0.00/0.00 c obbt : 0 0 0 0
0.00/0.00 c probing : 0 0 0 0
0.00/0.00 c pseudoobj : 0 0 0 0
0.00/0.00 c redcost : 0 0 0 0
0.00/0.00 c rootredcost : 0 0 0 0
0.00/0.00 c symmetry : 0 0 0 0
0.00/0.00 c vbounds : 0 0 0 0
0.00/0.00 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp SB-Prop
0.00/0.00 c dualfix : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.00 c genvbounds : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.00 c nlobbt : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.00 c obbt : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.00 c probing : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.00 c pseudoobj : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.00 c redcost : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.00 c rootredcost : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.00 c symmetry : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.00 c vbounds : 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.00 c Conflict Analysis : Time Calls Success DomReds Conflicts Literals Reconvs ReconvLits Dualrays Nonzeros LP Iters (pool size: [--,--])
0.00/0.00 c propagation : 0.00 0 0 - 0 0.0 0 0.0 - - -
0.00/0.00 c infeasible LP : 0.00 0 0 - 0 0.0 0 0.0 0 0.0 0
0.00/0.00 c bound exceed. LP : 0.00 0 0 - 0 0.0 0 0.0 0 0.0 0
0.00/0.00 c strong branching : 0.00 0 0 - 0 0.0 0 0.0 - - 0
0.00/0.00 c pseudo solution : 0.00 0 0 - 0 0.0 0 0.0 - - -
0.00/0.00 c applied globally : 0.00 - - 0 0 0.0 - - 0 - -
0.00/0.00 c applied locally : - - - 0 0 0.0 - - 0 - -
0.00/0.00 c Separators : ExecTime SetupTime Calls RootCalls Cutoffs DomReds FoundCuts ViaPoolAdd DirectAdd Applied ViaPoolApp DirectApp Conss
0.00/0.00 c cut pool : 0.00 - 0 0 - - 0 0 - - - - - (maximal pool size: 0)
0.00/0.00 c aggregation : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c > cmir : - - - - - - - 0 0 0 0 0 -
0.00/0.00 c > flowcover : - - - - - - - 0 0 0 0 0 -
0.00/0.00 c > knapsackcover : - - - - - - - 0 0 0 0 0 -
0.00/0.00 c cgmip : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c clique : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c closecuts : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c convexproj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c disjunctive : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c eccuts : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c gauge : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c gomory : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c > gomorymi : - - - - - - - 0 0 0 0 0 -
0.00/0.00 c > strongcg : - - - - - - - 0 0 0 0 0 -
0.00/0.00 c impliedbounds : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c interminor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c intobj : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c lagromory : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c mcf : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c minor : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c mixing : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c multilinear : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c oddcycle : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c rapidlearning : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c rlt : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c zerohalf : 0.00 0.00 0 0 0 0 0 0 0 0 0 0 0
0.00/0.00 c Cutselectors : ExecTime SetupTime Calls RootCalls Selected Forced Filtered RootSelec RootForc RootFilt
0.00/0.00 c hybrid : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c ensemble : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c dynamic : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c Pricers : ExecTime SetupTime Calls Vars
0.00/0.00 c problem variables: 0.00 - 0 0
0.00/0.00 c Branching Rules : ExecTime SetupTime BranchLP BranchExt BranchPS Cutoffs DomReds Cuts Conss Children
0.00/0.00 c allfullstrong : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c cloud : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c distribution : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c fullstrong : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c gomory : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c inference : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c leastinf : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c lookahead : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c mostinf : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c multaggr : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c nodereopt : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c pscost : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c random : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c relpscost : 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c vanillafullstrong: 0.00 0.00 0 0 0 0 0 0 0 0
0.00/0.00 c Primal Heuristics : ExecTime SetupTime Calls Found Best
0.00/0.00 c LP solutions : 0.00 - - 0 0
0.00/0.00 c relax solutions : 0.00 - - 0 0
0.00/0.00 c pseudo solutions : 0.00 - - 0 0
0.00/0.00 c strong branching : 0.00 - - 0 0
0.00/0.00 c actconsdiving : 0.00 0.00 0 0 0
0.00/0.00 c adaptivediving : 0.00 0.00 0 0 0
0.00/0.00 c alns : 0.00 0.00 0 0 0
0.00/0.00 c bound : 0.00 0.00 0 0 0
0.00/0.00 c clique : 0.00 0.00 0 0 0
0.00/0.00 c coefdiving : 0.00 0.00 0 0 0
0.00/0.00 c completesol : 0.00 0.00 0 0 0
0.00/0.00 c conflictdiving : 0.00 0.00 0 0 0
0.00/0.00 c crossover : 0.00 0.00 0 0 0
0.00/0.00 c dins : 0.00 0.00 0 0 0
0.00/0.00 c distributiondivin: 0.00 0.00 0 0 0
0.00/0.00 c dks : 0.00 0.00 0 0 0
0.00/0.00 c dps : 0.00 0.00 0 0 0
0.00/0.00 c dualval : 0.00 0.00 0 0 0
0.00/0.00 c farkasdiving : 0.00 0.00 0 0 0
0.00/0.00 c feaspump : 0.00 0.00 0 0 0
0.00/0.00 c fixandinfer : 0.00 0.00 0 0 0
0.00/0.00 c fracdiving : 0.00 0.00 0 0 0
0.00/0.00 c gins : 0.00 0.00 0 0 0
0.00/0.00 c guideddiving : 0.00 0.00 0 0 0
0.00/0.00 c indicator : 0.00 0.00 0 0 0
0.00/0.00 c indicatordiving : 0.00 0.00 0 0 0
0.00/0.00 c intdiving : 0.00 0.00 0 0 0
0.00/0.00 c intshifting : 0.00 0.00 0 0 0
0.00/0.00 c linesearchdiving : 0.00 0.00 0 0 0
0.00/0.00 c localbranching : 0.00 0.00 0 0 0
0.00/0.00 c locks : 0.00 0.00 0 0 0
0.00/0.00 c lpface : 0.00 0.00 0 0 0
0.00/0.00 c mpec : 0.00 0.00 0 0 0
0.00/0.00 c multistart : 0.00 0.00 0 0 0
0.00/0.00 c mutation : 0.00 0.00 0 0 0
0.00/0.00 c nlpdiving : 0.00 0.00 0 0 0
0.00/0.00 c objpscostdiving : 0.00 0.00 0 0 0
0.00/0.00 c octane : 0.00 0.00 0 0 0
0.00/0.00 c ofins : 0.00 0.00 0 0 0
0.00/0.00 c oneopt : 0.00 0.00 0 0 0
0.00/0.00 c padm : 0.00 0.00 0 0 0
0.00/0.00 c proximity : 0.00 0.00 0 0 0
0.00/0.00 c pscostdiving : 0.00 0.00 0 0 0
0.00/0.00 c randrounding : 0.00 0.00 0 0 0
0.00/0.00 c rens : 0.00 0.00 0 0 0
0.00/0.00 c reoptsols : 0.00 0.00 0 0 0
0.00/0.00 c repair : 0.00 0.00 0 0 0
0.00/0.00 c rins : 0.00 0.00 0 0 0
0.00/0.00 c rootsoldiving : 0.00 0.00 0 0 0
0.00/0.00 c rounding : 0.00 0.00 0 0 0
0.00/0.00 c scheduler : 0.00 0.00 0 0 0
0.00/0.00 c shiftandpropagate: 0.00 0.00 0 0 0
0.00/0.00 c shifting : 0.00 0.00 0 0 0
0.00/0.00 c simplerounding : 0.00 0.00 0 0 0
0.00/0.00 c subnlp : 0.00 0.00 0 0 0
0.00/0.00 c trivial : 0.00 0.00 1 1 1
0.00/0.00 c trivialnegation : 0.00 0.00 0 0 0
0.00/0.00 c trustregion : 0.00 0.00 0 0 0
0.00/0.00 c trysol : 0.00 0.00 0 0 0
0.00/0.00 c twoopt : 0.00 0.00 0 0 0
0.00/0.00 c undercover : 0.00 0.00 0 0 0
0.00/0.00 c vbounds : 0.00 0.00 0 0 0
0.00/0.00 c veclendiving : 0.00 0.00 0 0 0
0.00/0.00 c zeroobj : 0.00 0.00 0 0 0
0.00/0.00 c zirounding : 0.00 0.00 0 0 0
0.00/0.00 c other solutions : - - - 0 -
0.00/0.00 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.00 c rens : 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.00 c rins : 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.00 c mutation : 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.00 c localbranching : 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.00 c crossover : 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.00 c proximity : 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.00 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.00 c dins : 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.00 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.00 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It ItLimit
0.00/0.00 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.00 c dual LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.00 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.00 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.00 c resolve instable : 0.00 0 0 0.00 -
0.00/0.00 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.00 c strong branching : 0.00 0 0 0.00 - - - 0
0.00/0.00 c (at root node) : - 0 0 0.00 -
0.00/0.00 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.00 c Relaxators : Time Calls Cutoffs ImprBounds ImprTime ReducedDom Separated AddedConss
0.00/0.00 c benders : 0.00 0 0 0 0.00 0 0 0
0.00/0.00 c B&B Tree :
0.00/0.00 c number of runs : 1
0.00/0.00 c nodes : 0 (0 internal, 0 leaves)
0.00/0.00 c feasible leaves : 0
0.00/0.00 c infeas. leaves : 0
0.00/0.00 c objective leaves : 0
0.00/0.00 c nodes (total) : 0 (0 internal, 0 leaves)
0.00/0.00 c nodes left : 0
0.00/0.00 c max depth : -1
0.00/0.00 c max depth (total): -1
0.00/0.00 c backtracks : 0 (0.0%)
0.00/0.00 c early backtracks : 0 (0.0%)
0.00/0.00 c nodes exc. ref. : 0 (0.0%)
0.00/0.00 c delayed cutoffs : 0
0.00/0.00 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.00 c avg switch length: 0.00
0.00/0.00 c switching time : 0.00
0.00/0.00 c Root Node :
0.00/0.00 c First LP value : -
0.00/0.00 c First LP Iters : 0
0.00/0.00 c First LP Time : 0.00
0.00/0.00 c Final Dual Bound : -
0.00/0.00 c Final Root Iters : 0
0.00/0.00 c Root LP Estimate : -
0.00/0.00 c Solution :
0.00/0.00 c Solutions found : 2 (2 improvements)
0.00/0.00 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.00 c Gap First Sol. : infinite
0.00/0.00 c Gap Last Sol. : infinite
0.00/0.00 c Primal Bound : -2.19700000000000e+03 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <relaxation>)
0.00/0.00 c Dual Bound : -2.19700000000000e+03
0.00/0.00 c Gap : 0.00 %
0.00/0.00 c Integrals : Total Avg%
0.00/0.00 c primal-dual : 0.20 100.00
0.00/0.00 c primal-ref : - - (not evaluated)
0.00/0.00 c dual-ref : - - (not evaluated)
0.00/0.00 c Time complete (sec): 0.005
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: 63665 MiB (60159 MiB free)
memory of node 1: 64507 MiB (60385 MiB free)
node distances:
10 21
21 10
command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-4517961-1751533889/watcher-4517961-1751533889 -o /tmp/evaluation-result-4517961-1751533889/solver-4517961-1751533889 -C 3600 -W 3700 -M 31000 --bin-var /tmp/runsolver-exch-nodeC027-1751526542-73833 --watchdog 3760 pbsolver -f HOME/instance-4517961-1751533889.opb -t 3600 -m 31000
running on 2 cores: 0,2
CPU governors:
performance: 0 2
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 5.14.0-503.14.1.el9_5.x86_64
Starting watchdog thread
Current StackSize limit: 8192 KiB
solver pid=75379, runsolver pid=75376
[startup+0.0064971 s]
# the end of solver process 75379 was just reported to runsolver
# Child status: 0
# cumulated CPU time of all completed processes: user=0.002699 s, system=0.00361 s
Solver just ended.
??? end of watcher thread
Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.00655003
CPU time (s): 0.006309
CPU user time (s): 0.002699
CPU system time (s): 0.00361
CPU usage (%): 96.3202
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.002699
system time used= 0.00361
maximum resident set size= 13568
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 1075
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= 3
involuntary context switches= 0
# summary of solver processes directly reported to runsolver:
# pid: 75379
# total CPU time (s): 0.006309
# total CPU user time (s): 0.002699
# total CPU system time (s): 0.00361
??? join timestamper begins
??? join timestamper ends
??? end of timestamper thread
runsolver used 0.005157 second user time and 0.011321 second system time
The end