| Solver Name | Answer | CPU time | Wall clock time |
|---|---|---|---|
| PB09: SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009) | SAT | 0.103983 | 0.104258 |
| Name | normalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/ manquinho/dbsg/normalized-dbsg_50_10_2_5.opb |
| MD5SUM | 3ff71bc8098c3f177d1ed4fad338b20c |
| Bench Category | DEC-SMALLINT-NLC (no optimisation, small integers, non linear constraints) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 0 |
| Best CPU time to get the best result obtained on this benchmark | 0.003998 |
| Has Objective Function | NO |
| Satisfiable | YES |
| (Un)Satisfiability was proved | YES |
| Best value of the objective function | |
| Optimality of the best value was proved | NO |
| Number of variables | 100 |
| Total number of constraints | 152 |
| Number of constraints which are clauses | 50 |
| Number of constraints which are cardinality constraints (but not clauses) | 1 |
| Number of constraints which are nor clauses,nor cardinality constraints | 101 |
| Minimum length of a constraint | 2 |
| Maximum length of a constraint | 100 |
| Number of terms in the objective function | 0 |
| Biggest coefficient in the objective function | 0 |
| Number of bits for the biggest coefficient in the objective function | 0 |
| Sum of the numbers in the objective function | 0 |
| Number of bits of the sum of numbers in the objective function | 0 |
| Biggest number in a constraint | 5 |
| Number of bits of the biggest number in a constraint | 3 |
| Biggest sum of numbers in a constraint | 100 |
| Number of bits of the biggest sum of numbers | 7 |
| Number of products (including duplicates) | 1232 |
| Sum of products size (including duplicates) | 2464 |
| Number of different products | 616 |
| Sum of products size | 1232 |
0.00/0.00 c SCIP version 1.1.0.7
0.00/0.00 c LP-Solver SoPlex 1.4.1
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c read problem <HOME/instance-3737738-1338751030.opb>
0.00/0.00 c original problem has 716 variables (716 bin, 0 int, 0 impl, 0 cont) and 768 constraints
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c start presolving problem
0.00/0.01 c presolving:
0.04/0.05 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 5028 impls, 100 clqs
0.04/0.06 c presolving (2 rounds):
0.04/0.06 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.04/0.06 c 5028 implications, 100 cliques
0.04/0.06 c presolved problem has 716 variables (716 bin, 0 int, 0 impl, 0 cont) and 768 constraints
0.04/0.06 c 1 constraints of type <knapsack>
0.04/0.06 c 100 constraints of type <setppc>
0.04/0.06 c 616 constraints of type <and>
0.04/0.06 c 1 constraints of type <linear>
0.04/0.06 c 50 constraints of type <logicor>
0.04/0.06 c transformed objective value is always integral (scale: 1)
0.04/0.06 c Presolving Time: 0.03
0.04/0.06 c SATUNSAT-NLC
0.04/0.06 c -----------------------------------------------------------------------------------------------
0.04/0.06 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.04/0.06 c separating/flowcover/freq = c -1
0.04/0.06 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.04/0.06 c separating/cmir/freq = c -1
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/veclendiving/maxlpiterofs = c 1500
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.04/0.06 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/veclendiving/freq = c -1
0.04/0.06 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.04/0.06 c heuristics/simplerounding/freq = c -1
0.04/0.06 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/shifting/freq = c -1
0.04/0.06 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.04/0.06 c heuristics/rounding/freq = c -1
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.04/0.06 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.04/0.06 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.04/0.06 c heuristics/rootsoldiving/freq = c -1
0.04/0.06 c # number of nodes added to the contingent of the total nodes
0.04/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.04/0.06 c heuristics/rens/nodesofs = c 2000
0.04/0.06 c # minimum percentage of integer variables that have to be fixable
0.04/0.06 c # [type: real, range: [0,1], default: 0.5]
0.04/0.06 c heuristics/rens/minfixingrate = c 0.3
0.04/0.06 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.04/0.06 c heuristics/rens/freq = c -1
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.04/0.06 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/pscostdiving/freq = c -1
0.04/0.06 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.04/0.06 c heuristics/oneopt/freq = c -1
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.04/0.06 c # maximal fraction of diving LP iterations compared to total iteration number
0.04/0.06 c # [type: real, range: [0,1], default: 0.01]
0.04/0.06 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.04/0.06 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.04/0.06 c heuristics/objpscostdiving/freq = c -1
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.04/0.06 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/linesearchdiving/freq = c -1
0.04/0.06 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/intshifting/freq = c -1
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/intdiving/maxlpiterquot = c 0.075
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/guideddiving/maxlpiterofs = c 1500
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.04/0.06 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/guideddiving/freq = c -1
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/fracdiving/maxlpiterofs = c 1500
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.04/0.06 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/fracdiving/freq = c -1
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/feaspump/maxlpiterofs = c 2000
0.04/0.06 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.04/0.06 c heuristics/feaspump/freq = c -1
0.04/0.06 c # minimum percentage of integer variables that have to be fixed
0.04/0.06 c # [type: real, range: [0,1], default: 0.666]
0.04/0.06 c heuristics/crossover/minfixingrate = c 0.5
0.04/0.06 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.04/0.06 c # [type: real, range: [0,1], default: 0.1]
0.04/0.06 c heuristics/crossover/nodesquot = c 0.15
0.04/0.06 c # number of nodes without incumbent change that heuristic should wait
0.04/0.06 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.04/0.06 c heuristics/crossover/nwaitingnodes = c 100
0.04/0.06 c # number of nodes added to the contingent of the total nodes
0.04/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.04/0.06 c heuristics/crossover/nodesofs = c 750
0.04/0.06 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 30]
0.04/0.06 c heuristics/crossover/freq = c -1
0.04/0.06 c # additional number of allowed LP iterations
0.04/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.04/0.06 c heuristics/coefdiving/maxlpiterofs = c 1500
0.04/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.04/0.06 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.04/0.06 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.04/0.06 c heuristics/coefdiving/freq = c -1
0.04/0.06 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.06 c presolving/probing/maxrounds = c 0
0.04/0.06 c # should presolving try to simplify knapsacks
0.04/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.06 c constraints/knapsack/simplifyinequalities = c TRUE
0.04/0.06 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.04/0.06 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.04/0.06 c constraints/knapsack/disaggregation = c FALSE
0.04/0.06 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.06 c constraints/knapsack/maxnumcardlift = c 0
0.04/0.06 c # should presolving try to simplify inequalities
0.04/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.04/0.06 c constraints/linear/simplifyinequalities = c TRUE
0.04/0.06 c # maximal number of separation rounds in the root node (-1: unlimited)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.06 c separating/maxroundsroot = c 5
0.04/0.06 c # maximal number of separation rounds per node (-1: unlimited)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 5]
0.04/0.06 c separating/maxrounds = c 1
0.04/0.06 c # solving stops, if the given number of solutions were found (-1: no limit)
0.04/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.04/0.06 c limits/solutions = c 1
0.04/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.04/0.06 c limits/memory = c 13950
0.04/0.06 c # maximal time in seconds to run
0.04/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.04/0.06 c limits/time = c 1791
0.04/0.06 c # frequency for displaying node information lines
0.04/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.04/0.06 c display/freq = c 10000
0.04/0.06 c -----------------------------------------------------------------------------------------------
0.04/0.06 c start solving problem
0.04/0.06 c
0.04/0.06 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.04/0.06 c 0.0s| 1 | 0 | 27 |3252k| 0 | 19 | 716 | 768 | 768 | 716 |1384 | 0 | 0 | 0 | 1.000000e+01 | -- | Inf
0.04/0.09 c 0.1s| 1 | 0 | 28 |3263k| 0 | 0 | 716 | 768 | 768 | 716 |1385 | 1 | 0 | 0 | 1.000000e+01 | -- | Inf
0.04/0.09 c * 0.1s| 1 | 0 | 28 |3264k| 0 | - | 716 | 768 | 768 | 716 |1385 | 1 | 0 | 0 | 1.000000e+01 | 1.000000e+01 | 0.00%
0.04/0.09 c
0.04/0.09 c SCIP Status : problem is solved [optimal solution found]
0.04/0.09 c Solving Time (sec) : 0.06
0.04/0.09 c Solving Nodes : 1
0.04/0.09 c Primal Bound : +1.00000000000000e+01 (1 solutions)
0.04/0.09 c Dual Bound : +1.00000000000000e+01
0.04/0.09 c Gap : 0.00 %
0.04/0.09 c NODE 1
0.04/0.09 c DUAL BOUND 10
0.04/0.09 c PRIMAL BOUND 10
0.04/0.09 c GAP 0
0.04/0.09 s SATISFIABLE
0.04/0.09 v -x90 -x69 -x56 -x86 -x85 -x63 -x60 -x57 -x95 -x72 -x79 -x58 -x67 -x54 -x97 -x61 -x92 -x66 -x52 -x98 -x84 -x83 -x77 -x71 -x59 -x53
0.04/0.09 v -x81 -x68 -x74 -x55 -x88 -x94 -x100 -x80 -x51 -x87 -x82 -x75 -x73 -x64 -x93 x96 -x78 x65 -x99 -x62 x76 x89 -x70 x91 -x50 -x49
0.04/0.09 v -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24
0.04/0.09 v -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 x12 -x11 -x10 x9 -x8 -x7 x6 -x5 x4 x3 -x2 -x1
0.04/0.09 c SCIP Status : problem is solved [optimal solution found]
0.04/0.09 c Solving Time : 0.06
0.04/0.09 c Original Problem :
0.04/0.09 c Problem name : HOME/instance-3737738-1338751030.opb
0.04/0.09 c Variables : 716 (716 binary, 0 integer, 0 implicit integer, 0 continuous)
0.04/0.09 c Constraints : 768 initial, 768 maximal
0.04/0.09 c Presolved Problem :
0.04/0.09 c Problem name : t_HOME/instance-3737738-1338751030.opb
0.04/0.09 c Variables : 716 (716 binary, 0 integer, 0 implicit integer, 0 continuous)
0.04/0.09 c Constraints : 768 initial, 768 maximal
0.04/0.09 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.04/0.09 c trivial : 0.00 0 0 0 0 0 0 0 0
0.04/0.09 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.04/0.09 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.04/0.09 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.04/0.09 c implics : 0.00 0 0 0 0 0 0 0 0
0.04/0.09 c probing : 0.00 0 0 0 0 0 0 0 0
0.04/0.09 c knapsack : 0.00 0 0 0 0 0 0 0 0
0.04/0.09 c setppc : 0.01 0 0 0 0 0 0 0 0
0.04/0.09 c and : 0.02 0 0 0 0 0 0 0 0
0.04/0.09 c linear : 0.00 0 0 0 0 0 0 0 0
0.04/0.09 c logicor : 0.00 0 0 0 0 0 0 0 0
0.04/0.09 c root node : - 0 - - 0 - - - -
0.04/0.09 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.04/0.09 c integral : 0 0 0 1 0 0 0 0 0 0
0.04/0.09 c knapsack : 1 2 1 1 0 0 0 0 0 0
0.04/0.09 c setppc : 100 2 1 1 0 0 0 0 0 0
0.04/0.09 c and : 616 2 1 1 0 0 0 0 0 0
0.04/0.09 c linear : 1 2 1 1 0 0 0 0 0 0
0.04/0.09 c logicor : 50 2 1 1 0 0 0 0 0 0
0.04/0.09 c countsols : 0 0 0 1 0 0 0 0 0 0
0.04/0.09 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.04/0.09 c integral : 0.00 0.00 0.00 0.00 0.00
0.04/0.09 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.04/0.09 c setppc : 0.00 0.00 0.00 0.00 0.00
0.04/0.09 c and : 0.00 0.00 0.00 0.00 0.00
0.04/0.09 c linear : 0.00 0.00 0.00 0.00 0.00
0.04/0.09 c logicor : 0.00 0.00 0.00 0.00 0.00
0.04/0.09 c countsols : 0.00 0.00 0.00 0.00 0.00
0.04/0.09 c Propagators : Time Calls Cutoffs DomReds
0.04/0.09 c rootredcost : 0.00 0 0 0
0.04/0.09 c pseudoobj : 0.00 2 0 0
0.04/0.09 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.04/0.09 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.04/0.09 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.04/0.09 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.04/0.09 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.04/0.09 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.04/0.09 c applied globally : - - - 0 0.0 - - -
0.04/0.09 c applied locally : - - - 0 0.0 - - -
0.04/0.09 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.04/0.09 c cut pool : 0.00 1 - - 0 - (maximal pool size: 5)
0.04/0.09 c redcost : 0.00 2 0 0 0 0
0.04/0.09 c impliedbounds : 0.00 1 0 0 0 0
0.04/0.09 c intobj : 0.00 0 0 0 0 0
0.04/0.09 c gomory : 0.01 2 0 0 422 0
0.04/0.09 c strongcg : 0.02 2 0 0 422 0
0.04/0.09 c cmir : 0.00 0 0 0 0 0
0.04/0.09 c flowcover : 0.00 0 0 0 0 0
0.04/0.09 c clique : 0.00 2 0 0 0 0
0.04/0.09 c zerohalf : 0.00 0 0 0 0 0
0.04/0.09 c mcf : 0.00 1 0 0 0 0
0.04/0.09 c Pricers : Time Calls Vars
0.04/0.09 c problem variables: 0.00 0 0
0.04/0.09 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.04/0.09 c pscost : 0.00 0 0 0 0 0 0
0.04/0.09 c inference : 0.00 0 0 0 0 0 0
0.04/0.09 c mostinf : 0.00 0 0 0 0 0 0
0.04/0.09 c leastinf : 0.00 0 0 0 0 0 0
0.04/0.09 c fullstrong : 0.00 0 0 0 0 0 0
0.04/0.09 c allfullstrong : 0.00 0 0 0 0 0 0
0.04/0.09 c random : 0.00 0 0 0 0 0 0
0.04/0.09 c relpscost : 0.00 0 0 0 0 0 0
0.04/0.09 c Primal Heuristics : Time Calls Found
0.04/0.09 c LP solutions : 0.00 - 1
0.04/0.09 c pseudo solutions : 0.00 - 0
0.04/0.09 c simplerounding : 0.00 0 0
0.04/0.09 c rounding : 0.00 0 0
0.04/0.09 c shifting : 0.00 0 0
0.04/0.09 c intshifting : 0.00 0 0
0.04/0.09 c oneopt : 0.00 0 0
0.04/0.09 c fixandinfer : 0.00 0 0
0.04/0.09 c feaspump : 0.00 0 0
0.04/0.09 c coefdiving : 0.00 0 0
0.04/0.09 c pscostdiving : 0.00 0 0
0.04/0.09 c fracdiving : 0.00 0 0
0.04/0.09 c veclendiving : 0.00 0 0
0.04/0.09 c intdiving : 0.00 0 0
0.04/0.09 c actconsdiving : 0.00 0 0
0.04/0.09 c objpscostdiving : 0.00 0 0
0.04/0.09 c rootsoldiving : 0.00 0 0
0.04/0.09 c linesearchdiving : 0.00 0 0
0.04/0.09 c guideddiving : 0.00 0 0
0.04/0.09 c octane : 0.00 0 0
0.04/0.09 c rens : 0.00 0 0
0.04/0.09 c rins : 0.00 0 0
0.04/0.09 c localbranching : 0.00 0 0
0.04/0.09 c mutation : 0.00 0 0
0.04/0.09 c crossover : 0.00 0 0
0.04/0.09 c dins : 0.00 0 0
0.04/0.09 c LP : Time Calls Iterations Iter/call Iter/sec
0.04/0.09 c primal LP : 0.00 0 0 0.00 -
0.04/0.09 c dual LP : 0.00 2 28 14.00 -
0.04/0.09 c barrier LP : 0.00 0 0 0.00 -
0.04/0.09 c diving/probing LP: 0.00 0 0 0.00 -
0.04/0.09 c strong branching : 0.00 0 0 0.00 -
0.04/0.09 c (at root node) : - 0 0 0.00 -
0.04/0.09 c conflict analysis: 0.00 0 0 0.00 -
0.04/0.09 c B&B Tree :
0.04/0.09 c number of runs : 1
0.04/0.09 c nodes : 1
0.04/0.09 c nodes (total) : 1
0.04/0.09 c nodes left : 0
0.04/0.09 c max depth : 0
0.04/0.09 c max depth (total): 0
0.04/0.09 c backtracks : 0 (0.0%)
0.04/0.09 c delayed cutoffs : 0
0.04/0.09 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.04/0.09 c avg switch length: 2.00
0.04/0.09 c switching time : 0.00
0.04/0.09 c Solution :
0.04/0.09 c Solutions found : 1 (1 improvements)
0.04/0.09 c Primal Bound : +1.00000000000000e+01 (in run 1, after 1 nodes, 0.06 seconds, depth 0, found by <relaxation>)
0.04/0.09 c Dual Bound : +1.00000000000000e+01
0.04/0.09 c Gap : 0.00 %
0.04/0.09 c Root Dual Bound : +1.00000000000000e+01
0.09/0.10 c Time complete: 0.09.
OK 0
runsolver Copyright (C) 2010-2011 Olivier ROUSSEL This is runsolver version 3.3.1 (svn: 989) 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. command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-3737738-1338751030/watcher-3737738-1338751030 -o /tmp/evaluation-result-3737738-1338751030/solver-3737738-1338751030 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 15500 -f HOME/instance-3737738-1338751030.opb running on 4 cores: 0,2,4,6 Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 1800 seconds Enforcing CPUTime limit (hard limit, will send SIGXCPU): 1830 seconds Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 1900 seconds Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 15872000 KiB Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 15923200 KiB Current StackSize limit: 10240 KiB [startup+0 s] /proc/loadavg: 2.00 2.01 2.00 3/178 21697 /proc/meminfo: memFree=28293816/32873844 swapFree=7380/7380 [pid=21697] ppid=21695 vsize=9104 CPUtime=0 cores=0,2,4,6 /proc/21697/stat : 21697 (pbscip.linux.x8) R 21695 21697 21332 0 -1 4202496 1618 0 0 0 0 0 0 0 20 0 1 0 341227813 9322496 1570 33554432000 4194304 7823515 140735057750432 140735057747144 5878822 0 0 4096 0 0 0 0 17 4 0 0 0 0 0 /proc/21697/statm: 2276 1570 351 887 0 1386 0 [startup+0.0472059 s] /proc/loadavg: 2.00 2.01 2.00 3/178 21697 /proc/meminfo: memFree=28293816/32873844 swapFree=7380/7380 [pid=21697] ppid=21695 vsize=14012 CPUtime=0.04 cores=0,2,4,6 /proc/21697/stat : 21697 (pbscip.linux.x8) R 21695 21697 21332 0 -1 4202496 2919 0 0 0 2 2 0 0 20 0 1 0 341227813 14348288 2517 33554432000 4194304 7823515 140735057750432 140735057747144 6954986 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0 /proc/21697/statm: 3503 2517 404 887 0 2613 0 Current children cumulated CPU time (s) 0.04 Current children cumulated vsize (KiB) 14012 [startup+0.100284 s] /proc/loadavg: 2.00 2.01 2.00 3/178 21697 /proc/meminfo: memFree=28293816/32873844 swapFree=7380/7380 [pid=21697] ppid=21695 vsize=19628 CPUtime=0.09 cores=0,2,4,6 /proc/21697/stat : 21697 (pbscip.linux.x8) R 21695 21697 21332 0 -1 4202496 4621 0 0 0 6 3 0 0 20 0 1 0 341227813 20099072 4181 33554432000 4194304 7823515 140735057750432 140735057747144 4401518 0 0 4096 0 0 0 0 17 4 0 0 0 0 0 /proc/21697/statm: 4907 4181 558 887 0 4017 0 Current children cumulated CPU time (s) 0.09 Current children cumulated vsize (KiB) 19628 Solver just ended. Dumping a history of the last processes samples Child status: 0 Real time (s): 0.104258 CPU time (s): 0.103983 CPU user time (s): 0.067989 CPU system time (s): 0.035994 CPU usage (%): 99.7363 Max. virtual memory (cumulated for all children) (KiB): 19628 getrusage(RUSAGE_CHILDREN,...) data: user time used= 0.067989 system time used= 0.035994 maximum resident set size= 16724 integral shared memory size= 0 integral unshared data size= 0 integral unshared stack size= 0 page reclaims= 4626 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= 2 runsolver used 0 second user time and 0.008998 second system time The end
Begin job on node133 at 2012-06-03 21:17:10 IDJOB=3737738 IDBENCH=48306 IDSOLVER=2321 FILE ID=node133/3737738-1338751030 RUNJOBID= node133-1338747083-21348 PBS_JOBID= 14636776 Free space on /tmp= 70476 MiB SOLVER NAME= PB09: SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009) BENCH NAME= PB07/normalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/manquinho/dbsg/normalized-dbsg_50_10_2_5.opb COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t TIMEOUT -m MEMLIMIT -f BENCHNAME RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-3737738-1338751030/watcher-3737738-1338751030 -o /tmp/evaluation-result-3737738-1338751030/solver-3737738-1338751030 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 15500 -f HOME/instance-3737738-1338751030.opb TIME LIMIT= 1800 seconds MEMORY LIMIT= 15500 MiB NBCORE= 4 MD5SUM BENCH= 3ff71bc8098c3f177d1ed4fad338b20c RANDOM SEED=1112249104 node133.alineos.net Linux 2.6.32-71.29.1.el6.x86_64 #1 SMP Mon Jun 27 19:49:27 BST 2011 /proc/cpuinfo: processor : 0 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.540 cache size : 8192 KB physical id : 0 siblings : 4 core id : 0 cpu cores : 4 apicid : 0 initial apicid : 0 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5333.08 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 1 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.540 cache size : 8192 KB physical id : 1 siblings : 4 core id : 0 cpu cores : 4 apicid : 16 initial apicid : 16 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.92 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 2 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.540 cache size : 8192 KB physical id : 0 siblings : 4 core id : 1 cpu cores : 4 apicid : 2 initial apicid : 2 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.92 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 3 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.540 cache size : 8192 KB physical id : 1 siblings : 4 core id : 1 cpu cores : 4 apicid : 18 initial apicid : 18 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.91 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 4 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.540 cache size : 8192 KB physical id : 0 siblings : 4 core id : 2 cpu cores : 4 apicid : 4 initial apicid : 4 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.91 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 5 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.540 cache size : 8192 KB physical id : 1 siblings : 4 core id : 2 cpu cores : 4 apicid : 20 initial apicid : 20 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.90 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 6 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.540 cache size : 8192 KB physical id : 0 siblings : 4 core id : 3 cpu cores : 4 apicid : 6 initial apicid : 6 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.91 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 7 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.540 cache size : 8192 KB physical id : 1 siblings : 4 core id : 3 cpu cores : 4 apicid : 22 initial apicid : 22 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.91 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: /proc/meminfo: MemTotal: 32873844 kB MemFree: 28294444 kB Buffers: 489228 kB Cached: 2846336 kB SwapCached: 676 kB Active: 1858684 kB Inactive: 1817660 kB Active(anon): 332340 kB Inactive(anon): 10220 kB Active(file): 1526344 kB Inactive(file): 1807440 kB Unevictable: 7380 kB Mlocked: 7380 kB SwapTotal: 67108856 kB SwapFree: 67107040 kB Dirty: 9916 kB Writeback: 0 kB AnonPages: 348568 kB Mapped: 12344 kB Shmem: 0 kB Slab: 760036 kB SReclaimable: 201656 kB SUnreclaim: 558380 kB KernelStack: 1496 kB PageTables: 4480 kB NFS_Unstable: 0 kB Bounce: 0 kB WritebackTmp: 0 kB CommitLimit: 83545776 kB Committed_AS: 461912 kB VmallocTotal: 34359738367 kB VmallocUsed: 346376 kB VmallocChunk: 34341987860 kB HardwareCorrupted: 0 kB AnonHugePages: 311296 kB HugePages_Total: 0 HugePages_Free: 0 HugePages_Rsvd: 0 HugePages_Surp: 0 Hugepagesize: 2048 kB DirectMap4k: 7872 kB DirectMap2M: 33538048 kB Free space on /tmp at the end= 70464 MiB End job on node133 at 2012-06-03 21:17:10